/LMAR=0/XLINE=14/FONT#0=NGR25.FNT[XGP,SYS]/FONT#1=NGB25.FNT[XGP,SYS]/FONT#2=NGR20.FNT[XGP,SYS]/FONT#3=BDI25.FNT[XGP,SYS]/FONT#4=NGB30.FNT[XGP,SYS]/FONT#5=FIX20.FNT[XGP,SYS]/FONT#7=FIX25.FNT[XGP,SYS]
␈↓ ↓>␈↓␈α?␈α)␈↓∧  BEINGS: REPRESENTATION OF KNOWLEDGE AS INTERACTING MODULES␈↓

␈↓"∧␈↓ ↓>␈↓␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α0Douglas B. Lenat
␈↓"∧␈↓ ↓>␈↓␈α?␈α?␈α?␈α?␈α?␈α?␈α∩Stanford Artificial Intelligence Laboratory
␈↓"∧␈↓ ↓>␈↓␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α∨Stanford, California

␈↓"∧␈↓ ↓>␈↓␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈αε␈↓∧␈↓&ABSTRACT␈↓'β␈↓


␈↓"␈↓ ↓>␈↓␈↓ α≡Knowledge,␈α
including␈α
that␈α
of␈α
control,␈α
may␈αbe␈α
organized␈α
as␈α
a␈α
community␈α
of␈α
interacting␈αmodules
␈↓ ↓>␈↓(e.g.,␈αACTORS).␈αBy␈αgranting␈αeach␈αmodule␈αa␈αcomplex␈αstructure,␈αcomplex␈αbehaviors␈αare␈αeasily␈αelicited.␈αBy
␈↓ ↓>␈↓constraining␈α∞that␈α∞this␈α
structure␈α∞be␈α∞standard␈α∞over␈α
the␈α∞entire␈α∞community,␈α
the␈α∞advantages␈α∞of␈α∞a␈α
uniform
␈↓ ↓>␈↓formalism␈α∪are␈α∪preserved.␈α∪ Several␈α∪task␈α∪domains␈α∪are␈α∩considered;␈α∪the␈α∪most␈α∪natural␈α∪is␈α∪seen␈α∪to␈α∩be
␈↓ ↓>␈↓automatic␈α∀programming.␈α∪ An␈α∀experimental␈α∪system␈α∀was␈α∪partially␈α∀implemented␈α∪for␈α∀this␈α∪task.␈α∀It␈α∪has
␈↓ ↓>␈↓managed␈α
to␈α
synthesize␈α
a␈α
few␈α∞inductive␈α
inference␈α
LISP␈α
programs␈α
heuristically,␈α
from␈α∞specific␈α
restricted
␈↓ ↓>␈↓dialogues.  This research clarified some difficulties inherent to structured modular systems.
␈↓"∧
␈↓"∧␈↓ ↓>␈↓␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α∀␈↓∧␈↓&1. INTRODUCTION␈↓'β␈↓

␈↓"␈↓ ↓>␈↓␈↓ α≡This␈α⊂paper␈α⊂reports␈α∂on␈α⊂a␈α⊂scheme␈α⊂for␈α∂representing␈α⊂knowledge␈α⊂as␈α∂a␈α⊂pool␈α⊂of␈α⊂structured␈α∂units,
␈↓ ↓>␈↓called␈αBEINGs.␈α
 Each␈αmodule␈α
has␈αseveral␈α
␈↓βparts␈↓,␈αeach␈α
of␈αwhich␈α
is␈αeither␈α
␈↓βprimitive␈↓␈αor␈α
a␈αpointer␈αto␈α
another
␈↓ ↓>␈↓BEING.␈α∞ The␈α
name␈α∞of␈α∞a␈α
BEING␈α∞part␈α∞represents␈α
a␈α∞question␈α∞one␈α
expert␈α∞might␈α∞want␈α
to␈α∞ask␈α∞another;␈α
the
␈↓ ↓>␈↓value␈αof␈αthe␈αpart␈αis␈αthat␈αBEING's␈αanswer␈αto␈αthat␈αquestion.␈α Thus␈αthe␈αparts␈αcorrespond␈αto␈αthe␈αmessages
␈↓ ↓>␈↓in␈αthe␈αACTOR␈α[1]␈αformalism.␈α A␈αnew␈αconstraint␈αis␈αintroduced␈αhere,␈αhowever:␈αevery␈αBEING␈αhas␈αthe␈αsame
␈↓ ↓>␈↓set␈α
of␈α
parts␈α(with␈α
distinct␈α
values,␈αof␈α
course).␈α
 This␈α
uniformity␈αwas␈α
hoped␈α
to␈αpermit␈α
easy␈α
addition␈αof␈α
new
␈↓ ↓>␈↓BEINGs to the pool, and to facilitate communication among the BEINGs.

␈↓"␈↓ ↓>␈↓␈↓ α≡A␈α∞small␈α∞community␈α∞of␈α∞BEINGs␈α∞was␈α∂formed,␈α∞aimed␈α∞at␈α∞generating␈α∞LISP␈α∞programs␈α∂from␈α∞dialogues
␈↓ ↓>␈↓with␈αa␈αhuman␈αuser.␈αThis␈αexperimental␈αsystem,␈αPUP6,␈αwas␈αnot␈αa␈αformal␈αautomatic␈αprogramming␈αprogram,
␈↓ ↓>␈↓but␈αrather␈αused␈αthe␈αBEINGs␈αto␈αorganize␈αinformal␈αknowledge␈αabout␈αprogramming,␈αabout␈αthe␈αtask␈αdomain
␈↓ ↓>␈↓(inductive␈α
inference),␈α
and␈α
about␈α
transfer␈α
of␈α
control.␈α
 Three␈α
programs␈α
have␈α
actually␈α
been␈α
synthesized␈α
by
␈↓ ↓>␈↓PUP6:␈α⊂a␈α∂concept␈α⊂formation␈α⊂program␈α∂(similar␈α⊂to␈α⊂[2]),␈α∂a␈α⊂grammatical␈α⊂inference␈α∂program,␈α⊂and␈α⊂a␈α∂simple
␈↓ ↓>␈↓property␈α
list␈α
maintenance␈α
routine␈α∞(referred␈α
to␈α
below␈α
as␈α
CF,␈α∞GI,␈α
and␈α
PL,␈α
respectively).␈α∞Specification␈α
is
␈↓ ↓>␈↓via␈α
rigid␈α
dialogue,␈αcarried␈α
on␈α
at␈α
great␈αlength␈α
with␈α
the␈α
user,␈αin␈α
a␈α
small␈α
subset␈αof␈α
English,␈α
in␈α
which␈αthe
␈↓ ↓>␈↓task␈α
is␈α
delineated␈α
and␈α
questionable␈α
details␈α
are␈α
discussed.␈α
The␈α
specification␈α
is␈α
partial␈α∞(ambiguous);␈α
the
␈↓ ↓>␈↓system␈α∞makes␈α∞assumptions␈α
continually.␈α∞ This␈α∞process␈α
will␈α∞be␈α∞referred␈α
to␈α∞as␈α∞␈↓βautomatic␈α
programming.␈↓
␈↓ ↓>␈↓The␈αcode␈αwhich␈αhas␈αbeen␈αsuccessfully␈αgenerated␈αis␈αcalled␈αthe␈α␈↓βtarget␈αprogram␈↓.␈α The␈αmain␈αsuccesses␈αof
␈↓ ↓>␈↓PUP6␈αwere␈αthat␈αthe␈αdesired␈αreasoning␈αsteps␈αin␈αthe␈αoriginal␈αhuman-programmer␈αprotocol␈αwere␈αactually
␈↓ ↓>␈↓simulated,␈αmost␈αof␈αthe␈αBEINGs␈αwere␈αcalled␈αon␈αin␈αwriting␈αall␈αthree␈αprograms,␈αand␈αa␈αnew␈α"style"␈αof␈α
target
␈↓ ↓>␈↓program␈α
was␈α
discovered␈α
(the␈α
user␈α
can␈α
interrupt␈α
and␈α
pose␈α
questions,␈α
just␈α
as␈α
he␈α
can␈α
with␈α∞the␈α
original
␈↓ ↓>␈↓pool␈α⊃of␈α⊃BEINGs).␈α⊃ The␈α⊃main␈α⊃defects␈α⊃were␈α⊃pup6's␈α⊃inflexibility␈α⊃to␈α⊃new␈α⊃dialogues,␈α⊃the␈α⊃inability␈α⊃of␈α⊃an
␈↓ ↓>␈↓untrained user to add new BEINGs, and the verbosity of the system.

␈↓"␈↓ ↓>␈↓␈↓ α≡Our␈α⊂treatment␈α⊂will␈α∂follow␈α⊂these␈α⊂lines:␈α⊂First,␈α∂the␈α⊂ideas␈α⊂of␈α∂the␈α⊂BEINGs␈α⊂scheme␈α⊂are␈α∂presented.
␈↓ ↓>␈↓Examples␈α
are␈α
then␈α
supplied␈α
to␈α
illustrate␈α
these␈αconcepts.␈α
The␈α
specific␈α
implementation␈α
in␈α
the␈α
domain␈αof
␈↓ ↓>␈↓automatic␈α
programming␈α
is␈αsketched.␈α
 Some␈α
of␈αits␈α
difficulties␈α
are␈αshown␈α
to␈α
reflect␈αon␈α
the␈α
BEINGs␈αideas
␈↓ ↓>␈↓themselves.

␈↓"∧␈↓ ↓>␈↓␈α?␈α?␈α?␈α?␈α?␈α?␈α*␈↓∧␈↓&2. General BEING System Ideas␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡How␈αshould␈α
knowledge␈αbe␈α
represented?␈α Many␈α
researchers␈αfeel␈α
that␈αa␈α
simple,␈αuniform␈α
formalism
␈↓ ↓>␈↓should␈α∞be␈α∞used␈α∞for␈α∞all␈α
facts;␈α∞others␈α∞disagree,␈α∞claiming␈α∞that␈α
complexity␈α∞of␈α∞behavior␈α∞both␈α∞justifies␈α
and
␈↓ ↓>␈↓demands␈αcomplexity␈αof␈αrepresentation.␈α The␈αbenefits␈αof␈αthe␈αformer␈αinclude␈αeasy␈αaddition␈αof␈αknowledge
␈↓ ↓>␈↓[3]␈αand␈αsimple,␈αaesthetic␈αmethods␈αfor␈α
communicating␈αand␈αcombining␈αinformation␈α[4].␈αStructure,␈α
however,
␈↓ ↓>␈↓is␈αnecessary␈αfor␈α(␈↓βcombinatorially␈↓)␈αefficient␈αhandling␈αof␈αlarge␈αamounts␈αof␈αdata␈α(see␈αthe␈αreal␈αworld;␈αalso
␈↓ ↓>␈↓[5]).␈α A␈α
BEING␈αis␈α
a␈αcollection␈α
of␈αseveral␈α
little␈αbits␈α
of␈αprocedural␈α
code;␈αthe␈α
answers␈αto␈α
questions␈αabout
␈↓ ↓>␈↓the␈α∂BEING.␈α⊂ That␈α∂is,␈α∂a␈α⊂BEING␈α∂is␈α⊂a␈α∂small,␈α∂loosely-knit␈α⊂program,␈α∂which␈α∂is␈α⊂considered␈α∂␈↓βequivalent␈↓␈α⊂to␈α∂its
␈↓ ↓>␈↓answers␈α∞to␈α∞these␈α∞fixed␈α∞questions.␈α∞ Every␈α∞piece␈α∞of␈α∞knowledge,␈α∞including␈α∞those␈α∞related␈α∞to␈α∞the␈α∂flow␈α∞of
␈↓ ↓>␈↓control␈αin␈αthe␈αsystem,␈αshould␈αbe␈αencoded␈αinto␈αBEINGs.␈αThere␈αshould␈αbe␈αnothing␈αelse␈αin␈αthe␈αsystem␈αbut
␈↓ ↓>␈↓this interacting community.  Thus BEINGs represent a compromise of structure and uniformity.

␈↓"␈↓ ↓>␈↓␈↓ α≡While␈α∂each␈α∂BEING␈α∂is␈α⊂highly␈α∂structured,␈α∂this␈α∂structure␈α∂is␈α⊂standard␈α∂over␈α∂the␈α∂entire␈α⊂pool.␈α∂Each
␈↓ ↓>␈↓BEING␈α
part␈α
is␈α
itself␈α
a␈α
little␈αBEING,␈α
etc.,␈α
and␈α
this␈α
infinite␈α
regress␈αstops␈α
when␈α
the␈α
contents␈α
of␈α
a␈αBEING␈α
part
␈↓ ↓>␈↓becomes␈αsufficiently␈αprimitive.␈α
 The␈αBEINGs␈αoperate␈αat␈α
about␈αthe␈αsame␈αlevel␈α
as␈αa␈αhuman␈αperforming␈α
the
␈↓ ↓>␈↓same␈α
task;␈α
BEINGs␈α
should␈α
consider␈α
as␈α
primitive␈α
just␈α
what␈α
he␈α
considers␈α
primitive.␈α
 For␈α
example,␈α
in␈α
the
␈↓ ↓>␈↓automatic␈α∞programming␈α∞task␈α∞(AP),␈α∞this␈α∞level␈α∞was␈α
typically␈α∞the␈α∞same␈α∞as␈α∞the␈α∞INTERLISP␈α∞[6]␈α∞language:␈α
a
␈↓ ↓>␈↓primitive␈αwas␈αa␈αsingle␈αINTERLISP␈αfunction␈αcall,␈αor␈αa␈αfew␈αsimple␈αones␈αconnected␈αtrivially.␈α Each␈αBEING␈αis
␈↓ ↓>␈↓cognizant␈αof␈αthe␈αset␈αof␈αthirty␈αquestions,␈αin␈αthe␈αsense␈αthat␈αin␈αanswering␈αone␈αof␈αthem␈αit␈αmay␈αfreely␈αask
␈↓ ↓>␈↓questions␈α
of␈α
other␈α
BEINGs␈α(often␈α
through␈α
nondeterministic␈α
goal␈αstatements).␈α
 A␈α
few␈α
of␈αthe␈α
BEING-PARTS
␈↓ ↓>␈↓for␈α
AP␈α
might␈α
be:␈α
what␈α
is␈α
your␈α
basic␈α
idea␈α
and␈α
purpose,␈α
what␈α
effects␈α
do␈α
you␈α
have,␈α
how␈α
do␈α∞you␈α
cause
␈↓ ↓>␈↓them,␈αwhat␈α
must␈αbe␈α
ensured␈αbefore␈αyou␈α
begin,␈αwhat␈α
is␈αyour␈αchance␈α
of␈αsuccess,␈α
whom␈αelse␈α
might␈αyou
␈↓ ↓>␈↓transfer␈αcontrol␈αto,␈αwhat␈αalternatives␈αto␈αyou␈αexist,␈αdo␈αyou␈αevaluate␈αyour␈αarguments,␈αwhat␈αis␈αthe␈α
nature
␈↓ ↓>␈↓of␈α∞the␈α
value␈α∞you␈α∞return,␈α
why␈α∞do␈α
you␈α∞want␈α∞to␈α
be␈α∞in␈α
control␈α∞now,␈α∞etc.␈α
 The␈α∞delineation␈α
of␈α∞this␈α∞set␈α
of
␈↓ ↓>␈↓questions␈αhas␈αmuch␈αto␈αdo␈αwith␈αthe␈αepistemology␈αof␈αprogramming.␈α Each␈αBEING␈αpart␈αhas␈αtwo␈αabilities:␈αit
␈↓ ↓>␈↓may␈α
be␈α
␈↓βasked␈↓␈α
about␈α
something,␈α
and␈α
it␈α
may␈α∞be␈α
␈↓βcalled␈↓␈α
on␈α
to␈α
do␈α
something.␈α
Each␈α
of␈α
these␈α∞may␈α
involve
␈↓ ↓>␈↓asking␈αand␈α
calling␈αother␈αparts␈α
of␈αitself␈α
and␈αof␈αother␈α
BEINGs,␈αbut␈αtypically␈α
the␈αsecond␈α
activity␈αinvolves
␈↓ ↓>␈↓an␈α∂extra␈α∞level␈α∂of␈α∂evaluation.␈α∞For␈α∂example,␈α∂the␈α∞ARGS␈α∂part␈α∞may␈α∂be␈α∂asked␈α∞simple␈α∂questions␈α∂about␈α∞the
␈↓ ↓>␈↓arguments to the BEING, and it is charged with binding the arguments when the BEING is given control.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α∞BEINGs␈α
control␈α∞themselves␈α
in␈α∞a␈α
simple␈α∞way.␈α
A␈α∞very␈α
general␈α∞BEING,␈α∞SERVE-THE-USER,␈α
has
␈↓ ↓>␈↓control␈α∞initially.␈α∂In␈α∞general,␈α∞some␈α∂BEING␈α∞␈↓βB␈↓␈α∞will␈α∂be␈α∞in␈α∞control.␈α∂ Its␈α∞BEING␈α∞parts␈α∂are␈α∞assembled␈α∂into␈α∞an
␈↓ ↓>␈↓executable␈α
function,␈αand␈α
it␈α
is␈αrun.␈α
 During␈α
the␈αcourse␈α
of␈α
its␈αreign,␈α
␈↓βB␈↓␈α
will␈αwant␈α
things␈α
done␈αand/or␈α
tested
␈↓ ↓>␈↓which␈α∩it␈α∩cannot␈α∩manage␈α∩by␈α∩itself.␈α∩ This␈α∩corresponds␈α∩to␈α∩when␈α∩a␈α∩normal␈α∩program␈α∩needs␈α∩to␈α∪call␈α∩a
␈↓ ↓>␈↓subroutine.␈α What␈α␈↓βB␈↓␈αdoes␈αis␈αto␈αcall␈αon␈αSATISFY,␈αa␈αBEING␈αwhich␈αis␈αthe␈αsystem's␈αgeneral␈αgoal␈αmechanism.
␈↓ ↓>␈↓All␈α
it␈α
need␈α
do␈αis␈α
accept␈α
a␈α
description␈αof␈α
what␈α
is␈α
needed,␈αthen␈α
ask␈α
the␈α
entire␈αpool␈α
"who␈α
can␈α
do␈αthis?"
␈↓ ↓>␈↓Another␈α∞general␈α∂BEING,␈α∞CHOOSE-FROM,␈α∞then␈α∂ranks␈α∞those␈α∞which␈α∂respond.␈α∞These␈α∞two␈α∂"special"␈α∞BEINGs
␈↓ ↓>␈↓seem␈α⊃to␈α⊃detract␈α⊃from␈α⊃the␈α⊃equality␈α⊃proclaimed␈α⊃earlier␈α⊃for␈α⊃all␈α⊃BEINGs.␈α⊃ But␈α⊃the␈α⊃mechanism␈α⊃for␈α⊂goal
␈↓ ↓>␈↓satisfaction␈αand␈αfor␈αchoosing␈αamong␈αvying␈αBEINGs␈α
is␈αstandard;␈αeither␈αit␈αmust␈αbe␈αduplicated␈αinside␈α
every
␈↓ ↓>␈↓BEING␈α∞or␈α∞else␈α∞factored␈α∞out␈α∞into␈α∞some␈α∞higher-level␈α∞(meta-,␈α∞interaction-)␈α∞BEINGs.␈α∞ Similarly,␈α∞the␈α∞way␈α∞a
␈↓ ↓>␈↓BEING's␈α∂parts␈α∂fit␈α∂together␈α∂is␈α∂uniform␈α∂over␈α∂all␈α∂the␈α∂BEINGs␈α∂at␈α∂all␈α∂times.␈α∂Thus␈α∂one␈α∂simple␈α∂function␈α∞(or
␈↓ ↓>␈↓assembled BEING; see 3.3) can assemble all the BEINGs initially into LISP functions.
␈↓ ↓>␈↓␈↓ α≡BEINGs␈α
are␈α
the␈α
only␈α
entities␈α
permitted␈α
(theoretically)␈α
to␈α
exist␈α
in␈α
our␈α
system;␈α
ergo,␈α
for␈α
the␈α
AP
␈↓ ↓>␈↓task, all the synthesized code must be written as BEINGs, and must be written by BEINGs.

␈↓"␈↓ ↓>␈↓␈↓ α≡An␈α∀obvious␈α∀but␈α∀crucial␈α∀consequence␈α∀is␈α∀that␈α∀␈↓βsome␈↓␈α∀BEING(s)␈α∀must␈α∀write␈α∀new␈α∀BEINGs.␈α∪The
␈↓ ↓>␈↓significant␈αdesign␈αdecision␈αwas␈αthat␈αthe␈αBEING␈α
who␈αknows␈αabout␈α␈↓βX␈↓␈αtakes␈αcharge␈αof␈α
generating␈αBEINGs
␈↓ ↓>␈↓relating␈α
to␈α
␈↓βX␈↓.␈α
 For␈α
example,␈α
the␈αINSERT␈α
BEING␈α
can␈α
do␈α
inserting␈α
by␈αone␈α
of␈α
a␈α
few␈α
algorithms,␈α
he␈αcan␈α
write
␈↓ ↓>␈↓(by␈α⊃specializing␈α⊃himself)␈α⊃more␈α⊃efficient,␈α∩special-purpose␈α⊃insert␈α⊃routines,␈α⊃and␈α⊃he␈α⊃can␈α∩answer␈α⊃thirty
␈↓ ↓>␈↓questions␈α⊗about␈α⊗inserting.␈α⊗This␈α∃idea␈α⊗is␈α⊗analogous␈α⊗to␈α⊗any␈α∃reliance␈α⊗upon␈α⊗experts␈α⊗[7],␈α⊗and␈α∃also
␈↓ ↓>␈↓reemphasizes␈α
the␈α
theme␈α
of␈α
any␈α
modular␈α∞representation␈α
of␈α
knowledge.␈α
 A␈α
second␈α
consequence␈α∞is␈α
that
␈↓ ↓>␈↓the␈α∂synthesized␈α∂code␈α∂will␈α⊂be␈α∂BEINGs,␈α∂hence␈α∂possess␈α∂all␈α⊂the␈α∂␈↓βtypes␈↓␈α∂of␈α∂"intelligence"␈α∂that␈α⊂the␈α∂original
␈↓ ↓>␈↓BEINGs␈αcommunity␈α
had␈α(modify␈α
itself␈αaccording␈α
to␈αthe␈α
user's␈αcomplaints,␈α
answer␈αquestions␈α
about␈αwhat␈α
it
␈↓ ↓>␈↓is doing as it runs).

␈↓"␈↓ ↓>␈↓␈↓ α≡In␈α
a␈α
similar␈αvein,␈α
␈↓βsome␈↓␈α
BEING(s)␈αmust␈α
do␈α
the␈αtranslation␈α
of␈α
the␈αusers'␈α
quasi-English␈α
inputs␈αinto
␈↓ ↓>␈↓BEING-usable␈αform.␈α␈↓&Each␈↓'β␈αBEING␈α␈↓βX␈↓␈αmust␈αhandle␈αEnglish␈αphrases␈αrelated␈αto␈α␈↓βX␈↓.␈α Thus␈αtranslation␈αconsists
␈↓ ↓>␈↓of␈α
querying␈α
"who␈α
can␈α
recognize␈α∞..."␈α
and␈α
waiting␈α
for␈α
a␈α∞response.␈α
For␈α
example,␈α
our␈α
INSERT␈α∞BEING␈α
must
␈↓ ↓>␈↓recognize␈α∪and␈α∪process␈α∪phrases␈α∪involving␈α∪inserting,␈α∪stack-pushing,␈α∪and␈α∪merging.␈α∪ A␈α∪result␈α∪of␈α∪this
␈↓ ↓>␈↓processing of natural language is that any phrase which can be translated can be acted upon.

␈↓"␈↓ ↓>␈↓␈↓ α≡Why␈αis␈αautomatic␈αprogramming␈α(AP)␈αa␈αgood␈αtask␈αfor␈αa␈αBEINGs␈αpool?␈α The␈αBEINGs␈αrepresentation
␈↓ ↓>␈↓may␈α∞be␈α∞suitable␈α∞for␈α∞simulating␈α∞any␈α∞complex␈α
task␈α∞␈↓βT␈↓␈α∞involving␈α∞frequent␈α∞small␈α∞interventions␈α∞by␈α
various
␈↓ ↓>␈↓experts.␈α∞In␈α∞addition␈α∞to␈α∞writing␈α∞programs,␈α∞this␈α∂activity␈α∞could␈α∞perhaps␈α∞be␈α∞as␈α∞diverse␈α∞as␈α∂playing␈α∞chess,
␈↓ ↓>␈↓coordinating␈α∪sensors/effectors,␈α∪simulating␈α∪physical␈α∀interactions,␈α∪doing␈α∪research␈α∪in␈α∀mathematics,␈α∪or
␈↓ ↓>␈↓playing␈α∂volleyball.␈α⊂ Some␈α∂of␈α⊂these␈α∂will␈α⊂be␈α∂elaborated␈α∂in␈α⊂section␈α∂3.␈α⊂ There␈α∂␈↓βis␈↓␈α⊂one␈α∂particular␈α⊂bias␈α∂of
␈↓ ↓>␈↓BEINGs␈α
toward␈α
writing␈α
high-level␈α
programs,␈α
over␈α
other␈α
activities.␈α
The␈α
new␈α
BEINGs␈α
created␈α
during␈αthe
␈↓ ↓>␈↓execution␈α
of␈α
a␈α
specified␈α
task␈α
are␈α
kept␈α
distinct␈α
from␈α
the␈α
original␈α
set␈α
of␈α
BEINGs.␈α
 Then␈α
a␈α
␈↓βprogram␈↓␈αfor␈α
task
␈↓ ↓>␈↓␈↓βT␈↓␈α
is␈α
accomplished␈α
by␈αdoing␈α
␈↓βT␈↓␈α
and␈α
then␈α
dumping␈αthe␈α
new␈α
BEINGs␈α
out␈α
onto␈αa␈α
new␈α
file.␈α
 The␈α
entire␈αold
␈↓ ↓>␈↓BEINGs␈α
pool␈αis␈α
then␈αtreated␈α
as␈αthe␈α
language␈αsupporting␈α
this␈αfile.␈α
 Henceforth,␈αthe␈α
task␈αfor␈α
the␈αBEINGs
␈↓ ↓>␈↓pool will be AP unless explicitly stated otherwise.

␈↓"␈↓ ↓>␈↓␈↓ α≡A␈α⊂few␈α⊂of␈α∂the␈α⊂"new␈α⊂ideas"␈α∂may␈α⊂be␈α⊂disguised␈α∂new␈α⊂biasses.␈α⊂ These␈α∂include␈α⊂lack␈α⊂of␈α∂reverence
␈↓ ↓>␈↓toward␈α∪the␈α∪exploratory␈α∪anthropomorphic␈α∪paradigm␈α∩(common␈α∪to␈α∪programming,␈α∪doing␈α∪math,␈α∪etc.)␈α∩of
␈↓ ↓>␈↓ignoring␈αdetails␈α
and␈αcatching␈α
them␈αlater␈α
by␈αdebugging.␈α
 As␈αin␈α
all␈αcomplex␈α
behavior,␈αdecisions␈α
continually
␈↓ ↓>␈↓crop␈α∂up␈α∂which␈α∂no␈α∂BEING␈α∂is␈α∂able␈α∂to␈α∂resolve␈α∞at␈α∂the␈α∂time.␈α∂The␈α∂BEINGs␈α∂system␈α∂should␈α∂always␈α∂spend␈α∞a
␈↓ ↓>␈↓significant␈α∞effort␈α
to␈α∞defer␈α∞the␈α
decision␈α∞as␈α∞long␈α
as␈α∞possible.␈α∞ When,␈α
at␈α∞last,␈α∞no␈α
progress␈α∞can␈α∞be␈α
made
␈↓ ↓>␈↓without␈α
its␈αresolution,␈α
and␈α
if␈αthe␈α
system␈αis␈α
still␈α
unsure,␈αthen␈α
either␈αthe␈α
user␈α
settles␈αthe␈α
question␈αor␈α
else
␈↓ ↓>␈↓a␈αbacktrack␈αpoint␈αis␈αreluctantly␈αset␈αup.␈α Hopefully,␈αby␈αthis␈αtime,␈αsome␈αnew␈αinformation␈αis␈αpresent␈αwhich
␈↓ ↓>␈↓enables␈αthe␈α
system␈αto␈αresolve␈α
the␈αdecision,␈αthus␈α
reducing␈αthe␈α
amount␈αof␈αbacktracking.␈α
 If␈αthere␈αare␈α
two
␈↓ ↓>␈↓or␈α
more␈α
decisions␈α
which␈αcan␈α
no␈α
longer␈α
be␈αdeferred,␈α
the␈α
system␈α
tackles␈αfirst␈α
the␈α
one␈α
estimated␈α
to␈αbe
␈↓ ↓>␈↓the easiest (analogous to Occam's razor).

␈↓"␈↓ ↓>␈↓␈↓ α≡Another␈α∩prejudice␈α⊃is␈α∩that␈α⊃most␈α∩of␈α⊃the␈α∩carelessness␈α⊃"bugs"␈α∩can␈α⊃be␈α∩eliminated␈α∩through␈α⊃this
␈↓ ↓>␈↓deferral,␈α⊃feed-forward,␈α⊃and␈α⊃very␈α⊃precise␈α⊃record-keeping.␈α⊃ Humans␈α⊃depend␈α⊃on␈α⊃their␈α∩adaptability␈α⊃to
␈↓ ↓>␈↓compensate␈α∪for␈α∪limitations␈α∀in␈α∪their␈α∪brain␈α∪hardware␈α∀[3],␈α∪but␈α∪there␈α∪is␈α∀no␈α∪need␈α∪for␈α∀an␈α∪␈↓βautomatic␈↓
␈↓ ↓>␈↓programming␈α∞system␈α∞to␈α∞do␈α∞so.␈α∞ For␈α∞example,␈α∞when␈α
a␈α∞list␈α∞structure␈α∞is␈α∞first␈α∞encountered,␈α∞a␈α∞BEING␈α
can
␈↓ ↓>␈↓record␈α∩warnings␈α∩that␈α∩it␈α∪is␈α∩undefined,␈α∩unaccessed,␈α∩and␈α∩so␈α∪on.␈α∩ Each␈α∩such␈α∩worry␈α∩is␈α∪weighted␈α∩and
␈↓ ↓>␈↓deferred, but not forgotten.

␈↓"␈↓ ↓>␈↓␈↓ α≡Most␈αprogrammers␈αintentionally␈αaugment␈αtheir␈α
code␈αto␈αaid␈αin␈αlater␈αdebugging,␈α
modification,␈αand
␈↓ ↓>␈↓readability␈α∞by␈α∞humans.␈α∞ These␈α∞aids␈α∞are␈α∞typically␈α∞comments,␈α∞summaries,␈α∂over-generalized␈α∞subroutines,
␈↓ ↓>␈↓optional␈αprint␈αstatements,␈αand␈αruntime␈αstatistics.␈α Recently,␈αthe␈αstructure␈αof␈αthe␈αprogram␈αitself␈αhas␈αalso
␈↓ ↓>␈↓been␈αrecognized␈αas␈α
a␈αpowerful␈αmanipulable␈αelement,␈α
affecting␈αthe␈αaccessability␈αof␈α
the␈αcode,␈αnot␈αjust␈α
its
␈↓ ↓>␈↓length␈α
or␈αrunning␈α
time.␈α Any␈α
program␈αwritten␈α
as␈αa␈α
pool␈αof␈α
BEINGs␈αis␈α
several␈αtimes␈α
as␈αlong␈α
as␈α
a␈αclean
␈↓ ↓>␈↓hand-coded␈α∂version.␈α∂ This␈α∂extra␈α∂code,␈α∂the␈α∂parts␈α∞of␈α∂each␈α∂new␈α∂BEING␈α∂which␈α∂are␈α∂superfluous,␈α∂may␈α∞be
␈↓ ↓>␈↓viewed␈α⊃as␈α⊃well-organized␈α⊃self-documentation.␈α⊃ They␈α⊃should␈α⊃improve␈α⊃the␈α⊃debugging,␈α⊃expansion,␈α⊂and
␈↓ ↓>␈↓accessibility (to alien users) of the synthesized code.

␈↓"␈↓ ↓>␈↓␈↓ α≡Some␈α
assertions␈α
are␈α
so␈α
meaningful␈α∞to␈α
the␈α
user,␈α
that␈α
they␈α∞should␈α
be␈α
stored␈α
in␈α
the␈α∞code␈α
itself,
␈↓ ↓>␈↓even␈α∞if␈α
they␈α∞are␈α
only␈α∞temporary.␈α∞ At␈α
any␈α∞time,␈α
the␈α∞user␈α
may␈α∞look␈α∞at␈α
a␈α∞piece␈α
of␈α∞code;␈α∞the␈α
comments
␈↓ ↓>␈↓present␈α
␈↓βthen␈↓␈α
are␈α
all␈αassertions␈α
pertaining␈α
to␈α
that␈αpiece␈α
of␈α
code␈α
at␈αthat␈α
time.␈α
 BEINGS␈α
may␈αuse␈α
comments
␈↓ ↓>␈↓at␈α∂several␈α∞different␈α∂levels.␈α∞ At␈α∂the␈α∞lowest␈α∂level,␈α∞each␈α∂comment␈α∞is␈α∂merely␈α∞a␈α∂unique␈α∞token;␈α∂it␈α∂may␈α∞be
␈↓ ↓>␈↓inserted,␈α∞removed,␈α∞or␈α
searched␈α∞for.␈α∞ Slightly␈α∞better,␈α
the␈α∞BEINGs␈α∞system␈α∞can␈α
ask␈α∞"is␈α∞there␈α∞a␈α
comment
␈↓ ↓>␈↓involving␈α...".␈αFor␈αthis␈αpurpose,␈αa␈αconstrained␈αsyntax␈αfor␈αthe␈αcomments␈αshould␈αbe␈αdeveloped.␈αOtherwise
␈↓ ↓>␈↓(as,␈α∞unfortunately␈α∞in␈α∞PUP6)␈α∞each␈α
new␈α∞comment␈α∞must␈α∞be␈α∞attended␈α
to␈α∞ad␈α∞hoc.␈α∞ Still␈α∞higher␈α∞level␈α
usage
␈↓ ↓>␈↓would be looking at a comment totally ignorant of it, and ␈↓βtranslating␈↓ it into something meaningful.

␈↓"␈↓ ↓>␈↓␈↓ α≡By␈α
studying␈α
the␈α
difficulties␈α
of␈α
the␈α
implementations␈α
of␈α
the␈α
BEINGs␈α
ideas,␈α
isolating␈α
those␈α
due␈α
to
␈↓ ↓>␈↓poor␈αprogramming␈αfrom␈αthose␈αdue␈αto␈αpoor␈αideas,␈αenough␈αmay␈αbe␈αlearned␈αto␈αbuild␈αthe␈αnext␈αsystem␈αone
␈↓ ↓>␈↓qualitative␈α∂step␈α∂closer␈α⊂to␈α∂the␈α∂ideal.␈α⊂ It␈α∂is␈α∂in␈α∂this␈α⊂spirit␈α∂that␈α∂BEINGs␈α⊂are␈α∂now␈α∂contrasted␈α⊂against␈α∂the
␈↓ ↓>␈↓concepts of ACTORs, CLASSes, and FRAMES, and that the PUP6 system is examined.

␈↓"␈↓ ↓>␈↓␈↓ α≡ACTORS␈α→[1]␈α_provided␈α→the␈α_key␈α→concept␈α_of␈α→integrating␈α_uniformity␈α→of␈α→construction␈α_with
␈↓ ↓>␈↓sophistocation␈α
of␈α
behavior.␈α
There␈α
is␈αa␈α
continuum,␈α
among␈α
modular␈α
knowledge␈α
schemes,␈αof␈α
standardization
␈↓ ↓>␈↓of␈α∂"message"␈α∂types␈α∂between␈α⊂modules.␈α∂ACTORs␈α∂have␈α∂no␈α⊂restriction␈α∂whatsoever␈α∂on␈α∂this␈α⊂format.␈α∂Each
␈↓ ↓>␈↓module␈α
has␈α
its␈α
own,␈α
unique␈α
parts␈α
(types␈α
of␈α
answers).␈αSo␈α
each␈α
ACTOR␈α
must␈α
be␈α
aware␈α
of␈α
all␈α
the␈αparts
␈↓ ↓>␈↓(message␈αformats)␈αof␈α
all␈αthe␈αACTORs␈αit␈α
ever␈αis␈αgoing␈α
to␈αcommunicate␈αwith.␈αAdding␈α
a␈αnew␈αmodule␈αis␈α
thus
␈↓ ↓>␈↓conceptually␈α
intricate␈α
as␈α
well␈α
as␈α
practically␈α
difficult.␈αCLASSes␈α
[8]␈α
have␈α
a␈α
few␈α
standard␈α
parts,␈α
and␈αthe
␈↓ ↓>␈↓modules␈α
are␈α
arranged␈α
in␈α
groups,␈α
each␈α
of␈α
which␈αhas␈α
its␈α
own␈α
additional␈α
types␈α
of␈α
parts.␈α
Thus␈α
a␈αmodule␈α
can
␈↓ ↓>␈↓ask␈α∞␈↓βany␈↓␈α∂other␈α∞module␈α∂one␈α∞of␈α∂a␈α∞few␈α∂universal␈α∞questions,␈α∂and␈α∞it␈α∂can␈α∞ask␈α∂any␈α∞module␈α∂in␈α∞its␈α∂group␈α∞an
␈↓ ↓>␈↓additional␈αset␈αof␈αquestions.␈αIf␈αit␈αis␈αpermitted␈αto␈αknow␈αabout␈αother␈αgroups'␈αspecial␈αparts,␈αthen␈αthe␈αsame
␈↓ ↓>␈↓adding␈α
problem␈αrecurs.␈α
If␈αit␈α
is␈αdenied␈α
such␈αknowledge,␈α
it␈αcannot␈α
access␈αmuch␈α
of␈αthe␈α
knowledge␈α
in␈αthe
␈↓ ↓>␈↓pool.␈α
 If␈α
one␈α
requires␈α
a␈α
completely␈α
universal␈α
set␈αof␈α
message␈α
types,␈α
then␈α
most␈α
of␈α
them␈α
may␈αbe␈α
irrelevant
␈↓ ↓>␈↓to␈αmost␈α
modules.␈αThis␈αis␈α
the␈αprice␈αwhich␈α
BEINGs␈αpay.␈α
Later,␈αit␈αwill␈α
be␈αshown␈αthat␈α
this␈αsuperfluity␈αis␈α
real
␈↓ ↓>␈↓and␈α∂is␈α∂marginally␈α∂tolerable.␈α∂The␈α∞most␈α∂devastating␈α∂criticism␈α∂of␈α∂striving␈α∞for␈α∂a␈α∂universal␈α∂set␈α∂of␈α∞module
␈↓ ↓>␈↓questions␈αis␈αthat␈αall␈α
this␈αdoes␈αis␈αpush␈α
all␈αthe␈αnon-uniformity␈αdown␈αinto␈α
the␈α␈↓βvalues␈↓␈αof␈αthese␈α
parts.␈αThe
␈↓ ↓>␈↓only␈α
retort␈αis␈α
empirical:␈α
if␈αa␈α
good␈α
partitioning␈αof␈α
the␈α
questions␈αcan␈α
be␈α
found,␈αthen␈α
the␈αinternal␈α
structure
␈↓ ↓>␈↓of␈α∞each␈α∞part␈α∞with␈α∞the␈α∞same␈α∞name␈α∞will␈α∞be␈α∞comparable,␈α∞and␈α∞the␈α∞only␈α∞communication␈α∞necessary␈α∞will␈α
be
␈↓ ↓>␈↓simple accessing of modules's parts (direct questioning).
␈↓ ↓>␈↓␈↓ α≡FRAMES␈α
[9]␈α
seems␈α
superficially␈α
similar␈α
to␈α
BEINGs,␈α
and␈α
are␈α
so␈α
amorphous␈α
that␈α
they␈α
actually␈α
could
␈↓ ↓>␈↓subsume␈α
BEINGs.␈α
There␈α
is␈αa␈α
deep␈α
difference␈α
of␈α
philosophy␈αand␈α
of␈α
intended␈α
usage,␈α
however.␈α FRAMES
␈↓ ↓>␈↓intentionally␈α∞have␈α∂default␈α∞values␈α∂already␈α∞(with␈α∂no␈α∞processing)␈α∞filled␈α∂in␈α∞for␈α∂each␈α∞frame,␈α∂and␈α∞replaced
␈↓ ↓>␈↓only␈αwhen␈αnecessary.␈α This␈αis␈αakin␈αto␈αautomatic␈αprogramming␈αby␈αblind␈αdebugging,␈αbut␈αis␈αantithetical␈αto
␈↓ ↓>␈↓the␈α∪fastidious␈α∪bookkeeping␈α∪BEINGs␈α∀philosophy.␈α∪ As␈α∪an␈α∪example,␈α∀consider␈α∪the␈α∪writing␈α∪of␈α∀a␈α∪short,
␈↓ ↓>␈↓recursive␈α
LISP␈αprogram␈α
(reverse,␈αflatten,␈α
factorial,␈αalternate,␈α
etc.)␈αA␈α
human,␈αconsulting␈α
the␈αproper␈α
frame
␈↓ ↓>␈↓in␈αhis␈αhead,␈αknows␈αto␈αignore␈αthe␈αbase␈αstep␈αfor␈αa␈αwhile,␈αthen␈αfill␈αit␈αin,␈αusually␈αas␈α␈↓βif␈αNIL,␈αthen␈αNIL␈↓.␈α The
␈↓ ↓>␈↓human␈α⊃makes␈α⊃this␈α⊃default␈α⊃synthesis,␈α⊃tries␈α⊃out␈α∩the␈α⊃program,␈α⊃and␈α⊃looks␈α⊃closer␈α⊃(to␈α⊃fill␈α⊃in␈α∩this␈α⊃"slot"
␈↓ ↓>␈↓properly)␈αonly␈αif␈α
something␈αcalls␈αhis␈αattention␈α
to␈αit␈α(such␈αas␈α
a␈αLISP␈αerror␈αmessage:␈α
NON-NUMERIC␈αARG
␈↓ ↓>␈↓␈↓βNIL␈↓,␈αe.g.,␈α
if␈αwhat␈α
was␈αreally␈αneeded␈α
was␈αthe␈α
base␈αstep␈α
␈↓βif␈αNIL,␈αthen␈α
0␈↓).␈α A␈α
BEINGs␈αsystem␈α
would␈αalso
␈↓ ↓>␈↓defer␈α
working␈α
on␈α
the␈αbase␈α
step,␈α
but␈α
could␈α
--␈αand␈α
would␈α
--␈α
place␈α
a␈αnote␈α
about␈α
that␈α
deferral␈α
into␈αthe
␈↓ ↓>␈↓assertional␈α∩warning␈α⊃base.␈α∩ Before␈α⊃thinking␈α∩it␈α∩was␈α⊃finished,␈α∩the␈α⊃system␈α∩would␈α⊃attend␈α∩to␈α∩that␈α⊃note
␈↓ ↓>␈↓carefully. This is not a criticism of FRAMES: they are meant to model perception, BEINGs are not.
␈↓"∧
␈↓"∧␈↓ ↓>␈↓␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α:␈↓∧␈↓&3. Specific Examples␈↓'β
␈↓"∧
␈↓"∧␈↓ ↓>␈↓␈↓&3.1.  The set of BEING parts used in the automatic programming task␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡Below␈α
are␈αlisted␈α
the␈α
actual␈αset␈α
of␈α
BEING␈αparts␈α
which␈α
were␈αused␈α
in␈α
the␈αPUP6␈α
system.␈αThe␈α
overall
␈↓ ↓>␈↓task␈αfor␈αthe␈αBEINGs␈αis␈αto␈αwrite␈αprograms␈α--␈αi.e.,␈αmore␈αBEINGs.␈αNext␈αto␈αeach␈αpart␈αis␈αa␈αbrief␈αdescription,
␈↓ ↓>␈↓and the percentage of BEINGS in the system which actually needed to have this part.

␈↓"∧␈↓ ↓>␈↓␈↓↓IDEN␈↓ 54%  How is this BEING referenced in English phrases? Implemented as productions.
␈↓"∧␈↓ ↓>␈↓␈↓↓ARGS␈↓ 63%  How many arguments? Which are optional? Are there any local variables?
␈↓"∧␈↓ ↓>␈↓␈↓↓ARG-CHECK␈↓ 81%  Predicates which examine each argument for suitability.
␈↓"∧␈↓ ↓>␈↓␈↓↓EVAL-ARGS␈↓  4%  Which arguments are to be evaluated, and which quoted?
␈↓"∧␈↓ ↓>␈↓␈↓↓WHAT␈↓ 82%  A brief summary of the global purpose. Usually a template for an English sentence.
␈↓"∧␈↓ ↓>␈↓␈↓↓WHY␈↓ 77%  A justification of the BEING's existence. The caller explains here why it was called.
␈↓"∧␈↓ ↓>␈↓␈↓↓HOW␈↓ 72%  A summary of the methods the BEING intends to employ. Global strategies.
␈↓"∧␈↓ ↓>␈↓␈↓↓EFFECTS␈↓ 27%  What will probably be true after this BEING is through? What can it achieve?
␈↓"∧␈↓ ↓>␈↓␈↓↓WHEN␈↓ 19%  Why should this BEING be given control now? Computed as the sum of weighted factors.
␈↓"∧␈↓ ↓>␈↓␈↓↓META-CODE␈↓ 70%  The body of the executable code, but with uninstantiated subparts.
␈↓"∧␈↓ ↓>␈↓␈↓↓COMMENTS␈↓ 16%  Hints for filling in undefined sections of other BEING parts.
␈↓"∧␈↓ ↓>␈↓␈↓↓REQUISITES␈↓ 10%  If this BEING is actually chosen, what must be made true just before (pre-),
␈↓"∧␈↓ ↓>␈↓during (co-), and after (post-) execution?  Work to make these true (unlike ARG-CHECK).
␈↓"∧␈↓ ↓>␈↓␈↓↓DEMONS␈↓ 7%  Which demons should be kept active while the BEING is in control?
␈↓"∧␈↓ ↓>␈↓␈↓↓AFFECTS␈↓ 14%  Which other BEINGs might be called by this BEING, and why?
␈↓"∧␈↓ ↓>␈↓␈↓↓COMPLEXITY␈↓ 92%  A vector of utility measures, including ease of calling, chance of success, chance
␈↓"∧␈↓ ↓>␈↓of (calling)* itself, expected time cost, efficiency of its output results.
␈↓"∧␈↓ ↓>␈↓␈↓↓SPECIALIZATIONS␈↓ 40%  How to write a more streamlined, special-case version of this BEING.
␈↓"∧␈↓ ↓>␈↓␈↓↓GENERALIZATIONS␈↓ 27%  What are some other BEINGs, encompassing this one?
␈↓"∧␈↓ ↓>␈↓␈↓↓ALTERNATIVES␈↓ 16%  What are some equivalent BEINGs? (to try if this one fails)
␈↓"∧␈↓ ↓>␈↓␈↓↓RESULTS␈↓ 15%  How many values does this return? What domain is each in? Any side effects?
␈↓"∧␈↓ ↓>␈↓␈↓↓STRUCTURE␈↓ 4% If this is ever viewed as a data structure, what operations are done to it, and how?
␈↓"∧␈↓ ↓>␈↓␈↓↓ENCODABLE␈↓ 9%  How to order the evaluation of the other parts, when writing a new version.
␈↓"∧␈↓ ↓>␈↓␈↓↓INHIBIT-DEMONS␈↓  5%  A lock/unlock mechanism, useful when handling demonic interrupts.

␈↓"∧␈↓ ↓>␈↓␈↓&3.2.  A high-level domain-independent BEING␈↓'β


␈↓"␈↓ ↓>␈↓␈↓ α≡OBTAIN-USABLE-INFORMATION␈α⊂is␈α⊃a␈α⊂typical␈α⊂high-level,␈α⊃domain-independent␈α⊂BEING.␈α⊃ The␈α⊂WHEN
␈↓ ↓>␈↓part␈α∩consists␈α∩of␈α∩a␈α∪set␈α∩of␈α∩"␈↓∧if␈↓␈α∩<predicate>␈α∩␈↓∧then␈↓␈α∪<value>␈α∩␈↓∧because␈↓␈α∩<reason>"␈α∩expressions.␈α∪ If␈α∩the
␈↓ ↓>␈↓<predicate> evals to non-null, then the <value> program is executed.  It returns a number, which is
␈↓ ↓>␈↓added␈α∞in␈α∞as␈α∞a␈α∞factor␈α∞to␈α∞the␈α∞final␈α∞WHEN␈α∞value.␈α∞The␈α∞<reason>␈α∞evaluates␈α∞to␈α∞a␈α∞quasi-English␈α∂phrase␈α∞for
␈↓ ↓>␈↓inquisitive␈αhuman␈αusers.␈α The␈αfinal␈αsum␈αreflects␈αhow␈αgood␈αthis␈αBEING␈αwould␈αbe␈αto␈αpass␈αcontrol␈αto.␈α This
␈↓ ↓>␈↓"linear"␈α
scheme␈α
is␈α
undesirable,␈αrough,␈α
but␈α
adequate.␈α
 This␈αparticular␈α
BEING␈α
has␈α
factors␈α
which␈αrespond
␈↓ ↓>␈↓that␈α∂it␈α∞is␈α∂␈↓βalways␈↓␈α∂an␈α∞undesirable␈α∂thing␈α∂to␈α∞do,␈α∂but␈α∞␈↓βmay␈↓␈α∂be␈α∂indicated␈α∞if␈α∂there␈α∂exists␈α∞new␈α∂but␈α∂not␈α∞yet
␈↓ ↓>␈↓usable␈α
information.␈α∞ These␈α
factors,␈α
and␈α∞their␈α
weights␈α∞(see␈α
below),␈α
like␈α∞all␈α
the␈α
parts␈α∞of␈α
all␈α∞the␈α
BEINGs
␈↓ ↓>␈↓initially in PUP6, were decided upon and inserted by hand.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α
IDEN␈α
parts␈α
are␈α
collected␈α
together␈α
into␈α
a␈α
large␈α
translation␈α
table.␈α
 When␈α
a␈α
form␈α
␈↓βX␈↓␈α∞must␈α
be
␈↓ ↓>␈↓translated,␈α∪the␈α∩TRANSLATE␈α∪BEING␈α∪goes␈α∩through␈α∪this␈α∩table,␈α∪asking␈α∪each␈α∩IDEN␈α∪part␈α∩if␈α∪it␈α∪claims␈α∩to
␈↓ ↓>␈↓recognize␈α
␈↓βX␈↓.␈α
Each␈αIDEN␈α
runs␈α
its␈αown␈α
little␈α
program,␈αtypically␈α
some␈α
type␈αof␈α
pattern␈α
match␈α
involving␈α␈↓βX␈↓
␈↓ ↓>␈↓and␈α∞the␈α∞state␈α∞of␈α∞the␈α
world,␈α∞to␈α∞answer␈α∞this␈α∞question.␈α∞ If␈α
there␈α∞is␈α∞more␈α∞than␈α∞one␈α∞responder,␈α
CHOOSE-
␈↓ ↓>␈↓FROM␈α⊃picks␈α⊃the␈α⊃one␈α⊃with␈α⊃the␈α⊃highest␈α⊃priority␈α⊃of␈α⊃match.␈α⊃ The␈α⊃winner␈α⊃runs␈α⊃a␈α⊃little␈α∩program␈α⊃which
␈↓ ↓>␈↓ultimately␈α
returns␈α
a␈α
BEING-call␈α
or␈α
a␈α
constant␈α
as␈αthe␈α
translated␈α
value␈α
of␈α
␈↓βX␈↓.␈α
This␈α
program␈α
might␈αcall␈α
other
␈↓ ↓>␈↓BEINGs,␈αoften␈αcalls␈αTRANSLATE␈αseveral␈αtimes␈αrecursively␈αon␈αparts␈αof␈α␈↓βX␈↓.␈α Consider␈αthe␈αIDEN␈αpart␈αof␈αthe
␈↓ ↓>␈↓OBTAIN-USABLE-INFORMATION␈α∞BEING␈α∞(below).␈α∞ There␈α∞are␈α∞just␈α
two␈α∞classes␈α∞of␈α∞phrases␈α∞that␈α∞this␈α
BEING
␈↓ ↓>␈↓can␈αrecognize.␈α For␈αexample,␈αthe␈αsecond␈αusage␈αis␈αif␈αsome␈αBEING␈αor␈αuser␈αwants␈αto␈αfind␈αout␈αmore␈αabout
␈↓ ↓>␈↓anything, then OBTAIN-USABLE-INFORMATION can be called with that thing as argument.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α
EFFECTS␈α
parts␈α
of␈α
each␈α
BEING␈α
are␈α
similarly␈α
collected␈α
into␈α
one␈α
table␈α
to␈α
facilitate␈α
asking␈α
all
␈↓ ↓>␈↓BEINGs␈α
simultaneously␈α
"Can␈α
you␈α
cause␈α
effect␈α
X␈α
to␈α
occur?"␈α
Each␈α
EFFECTS␈α
part␈α
examines␈α
X␈α
and␈α
the␈α
world,
␈↓ ↓>␈↓and␈α∂either␈α⊂replies␈α∂No,␈α⊂or␈α∂else␈α⊂returns␈α∂a␈α⊂little␈α∂program␈α⊂(involving␈α∂calls␈α⊂and␈α∂constants)␈α⊂which␈α∂should
␈↓ ↓>␈↓produce␈αthe␈αeffect,␈αwith␈αa␈αcertain␈αprobability.␈α This␈αprogram␈αgenerally␈αwill␈αinvolve␈αa␈αcall␈αto␈αthe␈αBEING
␈↓ ↓>␈↓itself.␈α∞OBTAIN-USABLE-INFORMATION␈α∞shows␈α∞that␈α∞it␈α∞should␈α∞be␈α∞called␈α∞to␈α∞acheive␈α∞the␈α∞existence␈α∞of␈α
new,
␈↓ ↓>␈↓usable information (see the MAIN:EFFECTS part, below).

␈↓"␈↓ ↓>␈↓␈↓ α≡The WHAT, HOW, and WHY parts are mainly for the user's benefit.

␈↓"␈↓ ↓>␈↓␈↓ α≡When␈α
a␈α∞choice␈α
between␈α
BEINGs␈α∞must␈α
be␈α
made,␈α∞the␈α
WHEN,␈α
AFFECTS,␈α∞and␈α
COMPLEXITY-VECTOR
␈↓ ↓>␈↓parts are queried.

␈↓"␈↓ ↓>␈↓␈↓ α≡If␈αa␈αnew,␈αmanipulated␈αversion␈αof␈αthe␈αBEING␈αmust␈αbe␈αcreated,␈αthe␈αSPECIALIZATIONS,␈αENCODABLE,
␈↓ ↓>␈↓DATA-STRUCTURE, PREDICATE, and FORM-CHANGING parts might be relevant.

␈↓"␈↓ ↓>␈↓␈↓ α≡If␈αthe␈αBEING␈αfails,␈αsome␈αBEING␈αspecified␈αin␈αthe␈αALTERNATIVES␈αor␈αGENERALIZATIONS␈αparts␈αmight
␈↓ ↓>␈↓be tried.

␈↓"␈↓ ↓>␈↓␈↓ α≡In␈α∂the␈α∞current␈α∂case,␈α∞the␈α∂COMPLEXITY-VECTOR␈α∞says␈α∂that␈α∞it␈α∂is␈α∞of␈α∂average␈α∞difficulty␈α∂to␈α∂call,␈α∞its
␈↓ ↓>␈↓descendants␈αmay␈α(.5␈αchance)␈αcall␈αit␈α
back,␈αit␈αhas␈αan␈αaverage␈αchance␈α
of␈αsuccess␈αand␈αcost␈αof␈αattempting␈α
it,
␈↓ ↓>␈↓and there is no (.1) good reason to defer it any longer.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α∀AFFECTS␈α∀part␈α∀of␈α∀the␈α∀OBTAIN-USABLE-INFORMATION␈α∀BEING␈α∀is␈α∀clear.␈α∃CHOOSE-FROM␈α∀is
␈↓ ↓>␈↓definitely called, and four others might be.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α∂absence␈α∞of␈α∂some␈α∂parts,␈α∞like␈α∂DATA-STRUCTURE,␈α∂PREDICATE,␈α∞and␈α∂NLAMBDA,␈α∂indicates␈α∞that
␈↓ ↓>␈↓these␈α⊂qualities␈α⊂don't␈α⊂apply.␈α⊂ The␈α⊃absence␈α⊂of␈α⊂other␈α⊂parts,␈α⊂like␈α⊂SPECIALIZATIONS␈α⊃and␈α⊂ALTERNATIVES,
␈↓ ↓>␈↓indicates only a lack of thoroughness in filling out unneeded BEING parts.
␈↓ ↓>␈↓␈↓ α≡The␈α
META-CODE␈α
says␈αto␈α
choose␈α
from␈α
the␈αfollowing␈α
four␈α
alternatives,␈α
each␈αof␈α
which␈α
is␈α
itself␈αa
␈↓ ↓>␈↓BEING:␈α⊃Get-Brand-New-Information␈α⊂(in␈α⊃English,␈α⊃from␈α⊂the␈α⊃user),␈α⊂Translate␈α⊃something␈α⊃(transform␈α⊂from
␈↓ ↓>␈↓English␈α∞to␈α∞BEING-calls),␈α∞Analyze-The-Implications␈α
(of␈α∞some␈α∞existing,␈α∞translated␈α∞information),␈α
Extract-a-
␈↓ ↓>␈↓Relevant-Subset␈α(of␈αthe␈αexisting␈αinformation)␈αto␈αconcentrate␈αupon.␈α SATISFY␈αis␈αusually␈αemployed␈αwhen
␈↓ ↓>␈↓the␈αBEING␈αdoesn't␈αknow␈αexactly␈αwhich␈α
BEING␈αto␈αcall.␈αIf␈αthe␈α␈↓βset␈↓␈α
of␈αpossible␈αchoices␈αis␈αknown,␈αas␈α
in␈αthis
␈↓ ↓>␈↓case, then CHOOSE-FROM may be called with the explicit choice set.

␈↓"␈↓ ↓>␈↓␈↓ α≡Below␈α∞are␈α∞exhibited␈α∞the␈α∞actual␈α∞representation␈α∂of␈α∞this␈α∞BEING␈α∞in␈α∞PUP6,␈α∞and␈α∞the␈α∂function␈α∞which
␈↓ ↓>␈↓would be executed if it were ␈↓βcalled␈↓.


␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡␈↓β␈↓&PART␈↓'β    ␈↓&actual value of the part for OBTAIN-USABLE-INFORMATION  BEING␈↓'β␈↓¬

␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡IDEN ((if you see: (OBTAIN-USABLE-INFORMATION any1)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡       then return: (OBTAIN-USABLE-INFORMATION (TRANSLATE any1)))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡      (if you see: (FIND OUT MORE ABOUT any1)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡       then return: (OBTAIN-USABLE-INFORMATION any1)))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡EXPLICIT-ARGS (U)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡WHAT ( OBTAIN SOME INFORMATION WHICH CAN BE USED)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡HOW  ( OBTAIN NEW FACTS ABOUT OLD INFORMATION, OR OBTAIN TOTALLY NEW INFORMATION)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡WHY  ( PUP HAS NO MORE INFORMATION THAT IT CAN USE TO PROGRESS)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡WHEN ((if T then add in -10 because (THIS IS AN EXPONENTIALLY-GROWING, BAD THING TO DO IN GENERAL))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡      (if NEW-INFO-LIST then add in 111
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                because (WE SHOULD WORK ON UNASSIMILATED NEW  INFORMATION IF THERE IS ANY)))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡META-CODE (DO
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                 (CHOOSE-FROM ((TRANSLATE U)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                               (GET-NEW-INFORMATION U)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                               (ANALYZE-IMPLICATIONS U)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                               (EXTRACT-RELEVANT-SUBSET U)))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡           BECAUSE
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                 (WE CAN ONLY TRY TO OBTAIN USABLE INFORMATION IN ONE WAY AT A TIME))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡MAIN-EFFECTS ((to get (NEW INFO any1)     do (OBTAIN-USABLE-INFORMATION any1))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡              (to get (USABLE INFO any1)  do (OBTAIN-USABLE-INFORMATION any1)))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡AFFECTS       ( (CHOOSE-FROM IS CALLED)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                (TRANSLATE POSSIBLY IS CALLED)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                (GET-NEW-INFORMATION POSSIBLY IS CALLED)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                (ANALYZE-IMPLICATIONS POSSIBLY IS CALLED)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                (EXTRACT-RELEVANT-SUBSET POSSIBLY IS CALLED) )
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡COMPLEXITY-VECTOR (.5 .5 .5 .5 .1)

␈↓"∧␈↓ ↓>␈↓␈↓&3.3. What happens when a BEING is called␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡When␈αa␈αBEING␈αis␈α␈↓βcalled␈↓,␈αits␈αparts␈αare␈αassembled␈αinto␈αa␈αfunction␈αwhich␈αis␈αthen␈αexecuted.␈αHere␈αis
␈↓ ↓>␈↓the ␈↓βFUNCTIONAL␈↓ form of the OBTAIN-USABLE-INFORMATION BEING:

␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡(OBTAIN-USABLE-INFORMATION
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡  (LAMBDA (U FN-VALUE FINAL-CO-REQ)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡      (PROG1
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡          (AND
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡              (SETQ BEING-STACK (CONS OBTAIN-USABLE-INFORMATION BEING-STACK))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡              (PUT OBTAIN-USABLE-INFORMATION SPEC-WHY BECAUSE)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡              (EVERY (APPEND CURRENT-DEMONS USER-INTERRUPT-DEMONS)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                     (QUOTE APPLY*))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡              (SETQ BECAUSE
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                   (QUOTE (WE CAN ONLY TRY TO OBTAIN USABLE
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                              INFORMATION IN ONE WAY AT A TIME)))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡              (CHOOSE-FROM (QUOTE ((TRANSLATE U)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                                   (GET-NEW-INFORMATION U)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                                   (ANALYZE-IMPLICATIONS U)
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡                                   (EXTRACT-RELEVANT-SUBSET U)))))
␈↓"∧␈↓ ↓>␈↓¬␈↓ α≡          (SETQ BEING-STACK (CDR BEING-STACK)))))
␈↓ ↓>␈↓␈↓ α≡The␈α⊃process␈α∩of␈α⊃assembling␈α∩the␈α⊃BEING␈α∩parts␈α⊃into␈α∩a␈α⊃function␈α∩is␈α⊃straight-forward.␈α∩ First,␈α⊃the
␈↓ ↓>␈↓explicit␈α∞arguments␈α∞(those␈α∞global␈α∂to␈α∞the␈α∞BEING)␈α∞are␈α∞bound.␈α∂The␈α∞implicit␈α∞arguments␈α∞(those␈α∞local␈α∂to␈α∞the
␈↓ ↓>␈↓BEING,␈α∞like␈α∞PROG␈α∞variables)␈α∞are␈α∞initialized.␈α∞The␈α∞name␈α∞of␈α∞the␈α∞BEING␈α∞is␈α∞pushed␈α∞onto␈α∞the␈α∞BEING␈α∞control
␈↓ ↓>␈↓stack␈α
(pointing␈αto␈α
its␈αcaller),␈α
and␈αany␈α
newly-activated␈αdemons␈α
are␈αpushed␈α
onto␈αthe␈α
demon␈α
stack.␈α The
␈↓ ↓>␈↓ARGS-CHECK␈α∂predicates␈α∂are␈α⊂evaluated.␈α∂ Then␈α∂PUP6␈α⊂works␈α∂to␈α∂make␈α⊂each␈α∂PRE-REQUISITE␈α∂true␈α⊂in␈α∂the
␈↓ ↓>␈↓world.␈α Each␈αCOMMENT␈αis␈αevaluated,␈αthen␈α
the␈αCO-REQUISITES,␈αMETA-CODE,␈αand␈αcurrent␈αdemons␈α
all␈αare
␈↓ ↓>␈↓executed␈α⊃in␈α⊃pseudo-parallel.␈α⊂ Each␈α⊃POST-REQUISITE␈α⊃is␈α⊂then␈α⊃satisfied.␈α⊃ Since␈α⊂these␈α⊃activities␈α⊃are␈α⊂all
␈↓ ↓>␈↓embedded␈αin␈αan␈αAND,␈αany␈αof␈αthem␈αmay␈αcause␈αthe␈αentire␈αBEING␈αto␈αhalt␈αand␈αfail,␈αsimply␈αby␈αreturning␈αNIL.
␈↓ ↓>␈↓In␈αboth␈αcases,␈αjust␈α
before␈αexiting,␈αthe␈αdemon␈α
stack␈αis␈αpopped␈αand␈α
the␈αBEING␈αstack␈αis␈α
updated␈α(usually
␈↓ ↓>␈↓just␈αpopped),␈αand␈αcontrol␈αpasses␈αto␈αthe␈αdelegated␈αBEING␈α(usually␈αthe␈αone␈αwho␈αcalled␈αthis␈αBEING,␈αat␈αthe
␈↓ ↓>␈↓state when he called it).  A fancy context mechanism was available but not actually needed in PUP6.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈αfunction␈αwhich␈αassembled␈αall␈αthe␈αBEINGs␈αexploited␈αthe␈αfact␈αthat␈αit␈αoperated␈αonly␈αat␈αsystem
␈↓ ↓>␈↓load␈α⊃time.␈α⊃Thus␈α⊃if␈α⊃the␈α⊃BEING␈α⊃had␈α∩no␈α⊃new␈α⊃DEMONs␈α⊃to␈α⊃activate,␈α⊃all␈α⊃the␈α∩corresponding␈α⊃demon-stack
␈↓ ↓>␈↓manipulations␈α∂could␈α∂be␈α∂omitted.␈α∂Optimizations␈α∂like␈α∂these␈α∂are␈α∂clear␈α∂from␈α∂comparing␈α∂the␈α∂actual␈α∂stored
␈↓ ↓>␈↓parts␈α
of␈α
OBTAIN-USABLE-INFORMATION,␈α∞the␈α
description␈α
of␈α∞how␈α
it␈α
theoretically␈α∞should␈α
be␈α
made␈α∞into␈α
a
␈↓ ↓>␈↓function, and the actual function form (see above).
␈↓"∧
␈↓"∧␈↓ ↓>␈↓␈↓&3.4.  A high-level, domain-specific BEING␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡PARTITION-A-DOMAIN␈α
is␈αa␈α
high-level␈αBEING,␈α
specific␈α
to␈αthe␈α
domain␈αof␈α
writing␈αinductive␈α
inference
␈↓ ↓>␈↓programs,␈αwhose␈αbasic␈αidea␈αis␈αto␈αdivide␈αup␈αa␈αspace␈αinto␈αcategories.␈α Only␈αtwo␈αBEING␈αparts␈αare␈αfilled␈αin
␈↓ ↓>␈↓here␈α∂which␈α∂were␈α∂absent␈α∂from␈α∂OBTAIN-USABLE-INFORMATION;␈α∂namely,␈α∂SPECIALIZATIONS␈α⊂and␈α∂DEMONS.
␈↓ ↓>␈↓The␈αSPECIALIZATIONS␈α
part␈αsays␈αthat␈α
to␈αwrite␈αa␈α
specific␈αversion␈αof␈α
itself,␈αa␈αfew␈α
decisions␈αmust␈αbe␈α
made.
␈↓ ↓>␈↓The␈αresults␈αwill␈αthen␈α
indicate␈αwhat␈αpieces␈αof␈α
code␈αget␈αassembled␈αtogether␈α
to␈αform␈αthe␈αnew␈αBEING.␈α
 The
␈↓ ↓>␈↓partition␈αmay␈αbe␈α
only␈αpartial␈α(an␈α
element␈αof␈αthe␈α
domain␈αbelongs␈αto␈α
no␈αclass␈αof␈α
the␈αpartition),␈αonly␈α
weak
␈↓ ↓>␈↓(an␈αelement␈αbelongs␈α
to␈αmore␈αthan␈α
one␈αclass),␈αand,␈αmost␈α
importantly,␈αthe␈αspecialized␈α
partitioning␈αBEING
␈↓ ↓>␈↓should␈αwork␈αby␈αrepeatedly␈αdoing␈αsome␈αof␈α
the␈αfollowing␈αthree␈αactivities:␈αaccept␈αa␈αclass-name␈α
from␈αthe
␈↓ ↓>␈↓user␈αand␈αguess␈αsome␈αof␈αits␈αelements,␈αaccept␈αan␈αelement␈αfrom␈αthe␈αuser␈αand␈αtry␈αto␈αguess␈αwhich␈αclass␈αit
␈↓ ↓>␈↓belongs␈α∪to,␈α∪or␈α∩accept␈α∪an␈α∪<element,␈α∩class-name>␈α∪pair.␈α∪Other␈α∩BEINGs␈α∪know␈α∪about␈α∪these␈α∩accepting,
␈↓ ↓>␈↓guessing, and checking activities.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈αDEMONS␈α
part␈αsays␈α
that␈αduring␈α
the␈αpartitioning,␈αthe␈α
only␈αnew␈α
demon␈αto␈α
keep␈αactive␈α
is␈αthe
␈↓ ↓>␈↓one␈α∞called␈α∞Fringe-of-Consciousness,␈α∞which␈α∞we␈α∞now␈α∞illustrate.␈α
In␈α∞the␈α∞course␈α∞of␈α∞writing␈α∞GI,␈α∞the␈α
system
␈↓ ↓>␈↓learns␈α⊃that␈α⊃the␈α⊃main␈α⊃task␈α⊃is␈α⊂one␈α⊃of␈α⊃grammatical␈α⊃inference.␈α⊃ The␈α⊃Grammatical-Inference␈α⊃BEING␈α⊂then
␈↓ ↓>␈↓asserts␈αthat␈αif␈αthe␈αuser␈αever␈αmentions␈αthe␈αword␈αTEST,␈αhe␈αmay␈αactually␈αmean␈αPARSE.␈α This␈αis␈αplaced␈αin
␈↓ ↓>␈↓the␈αIDEN␈αpart␈αof␈αthe␈αTEST␈αBEING,␈αand␈αis␈αtherefore␈αonly␈αdemonized,␈αwaiting␈αon␈αthe␈αperiphery␈αof␈αPUP6's
␈↓ ↓>␈↓concentration.  It is in fact triggered later in the dialogue, as an inference surprising to the user.

␈↓"∧␈↓ ↓>␈↓␈↓&3.5.  The front and rear parts of the dialogue which results in CF␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈αdialogue␈αto␈αsynthesize␈αCF␈αbegins␈αby␈αPUP6␈αasking␈αthe␈αuser␈αfor␈αany␈αtask.␈α The␈αuser␈αreplies,
␈↓ ↓>␈↓␈↓βWrite␈α
a␈α
program␈α
which␈α
does␈αconcept␈α
formation␈↓.␈α
There␈α
are␈α
many␈αdecisions␈α
that␈α
PUP6␈α
knows␈α
about␈αin
␈↓ ↓>␈↓writing␈αa␈α
specialized␈αconcept␈α
formation␈αprogram␈α
[10],␈αand␈αit␈α
manages␈αto␈α
defer␈αthem␈α
all.␈α For␈αexample,␈α
it
␈↓ ↓>␈↓must␈α
choose␈α
between␈α
classificatory,␈α
comparative,␈α
and␈α
metrical␈α
concept␈α
formation.␈α
Since␈α
all␈αthree␈α
involve
␈↓ ↓>␈↓partitioning␈α⊃a␈α⊃domain␈α⊂of␈α⊃examples,␈α⊃PUP6␈α⊂decides␈α⊃it␈α⊃can␈α⊂defer␈α⊃this␈α⊃choice␈α⊂until␈α⊃after␈α⊃code␈α⊃for␈α⊂the
␈↓ ↓>␈↓partitioning␈α⊃is␈α⊃synthesized.␈α⊃ The␈α⊃effort␈α⊃of␈α⊃the␈α∩system␈α⊃is␈α⊃now␈α⊃directed␈α⊃toward␈α⊃this␈α⊃"piece"␈α∩of␈α⊃the
␈↓ ↓>␈↓program.␈α When␈αit␈αis␈αcompleted,␈αan␈αhour␈αor␈αtwo␈αlater,␈αthe␈αsystem␈αasks␈αthe␈αuser␈αto␈αmake␈α
this␈αdecision.
␈↓ ↓>␈↓When␈α
he␈α
responds␈α
␈↓βCLASSIFICATORY␈↓,␈αwhich␈α
involves␈α
␈↓βonly␈↓␈α
partitioning,␈αthe␈α
system␈α
prints␈α
that␈α
it␈αhas
␈↓ ↓>␈↓finished the entire CF task, and dumps the newly created BEINGs onto a file.

␈↓"∧␈↓ ↓>␈↓␈↓&3.6.  Admissability of popular AI language features␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈αclaim␈αis␈α
now␈αmade␈αthat␈α
the␈αpresence␈αof␈α
popular␈αAI␈αlanguage␈α
features␈αdo␈αnot␈α
detract␈αfrom
␈↓ ↓>␈↓the combinatorial behavior of the system, since BEINGs linearly subsume each mechanaism used.

␈↓"␈↓ ↓>␈↓␈↓ α≡A␈α
␈↓βdemon␈↓␈α
in␈α
PUP6␈α
is␈α
merely␈α
a␈α
function␈α
which␈α
gets␈α
executed␈α
periodically,␈α
and␈α
may␈αoccasionally
␈↓ ↓>␈↓trigger␈α∂a␈α∂BEING.␈α∞This␈α∂could␈α∂be␈α∂replaced␈α∞by␈α∂a␈α∂BEING␈α∞whose␈α∂EXPLICIT-ARGS-CHECK␈α∂part␈α∂contains␈α∞the
␈↓ ↓>␈↓triggering␈α∞predicate,␈α∞and␈α∞whose␈α
META-CODE␈α∞is␈α∞simply␈α∞a␈α
call␈α∞by␈α∞name␈α∞directly␈α
to␈α∞the␈α∞BEING␈α∞which␈α
is
␈↓ ↓>␈↓supposed to be activated.

␈↓"␈↓ ↓>␈↓␈↓ α≡An␈α
␈↓βassertion␈↓␈α
can␈αbe␈α
viewed␈α
as␈αa␈α
BEING␈α
containing␈αonly␈α
an␈α
IDEN␈αpart;␈α
when␈α
the␈αBEING␈α
recognizes
␈↓ ↓>␈↓a form which matches it, it returns the fully instantiated assertion.

␈↓"␈↓ ↓>␈↓␈↓ α≡A␈α∂␈↓βfunction␈↓␈α⊂is␈α∂equivalent␈α⊂to␈α∂a␈α⊂BEING␈α∂with␈α∂only␈α⊂META-CODE,␈α∂ARGS,␈α⊂and␈α∂NLAMBDA␈α⊂parts;␈α∂one
␈↓ ↓>␈↓knows almost nothing about it before executing it.

␈↓"∧␈↓ ↓>␈↓␈↓ α≡␈↓&3.7.  CF: the concept formation target program␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡CF␈αshould␈αoperate␈αby␈αrepeatedly␈αscanning␈αa␈αscene␈αand␈αtrying␈αto␈αname␈αit.␈αThe␈αscene␈α
is␈αbroken
␈↓ ↓>␈↓into␈α
a␈α
set␈α
of␈α
features␈α
and␈α
a␈α
set␈α
of␈α
objects.␈α
Each␈α
feature␈α
is␈α
a␈α
relation␈α
on␈α
one␈α
or␈α
more␈α
objects␈α
in␈αthe
␈↓ ↓>␈↓scene.␈α⊂ Internally,␈α⊂the␈α⊂program␈α⊂maintains␈α⊂a␈α⊂model␈α⊂for␈α⊂each␈α⊂differently-named␈α⊂structure␈α⊂it␈α⊂has␈α⊂ever
␈↓ ↓>␈↓encountered.␈α The␈αmodel␈αcontains␈αa␈αdescription␈αof␈αthe␈αobjects␈αexpected␈αin␈αthe␈αscene,␈αa␈αset␈αof␈αfeatures
␈↓ ↓>␈↓which␈αmust␈αbe␈αpresent␈αin␈αthe␈αscene␈α(else␈αit␈αcan't␈αbe␈αthe␈αsame␈αas␈αthis␈αconcept),␈αa␈αset␈αof␈αfeatures␈α
which
␈↓ ↓>␈↓must␈α
not␈α∞be␈α
present␈α∞in␈α
the␈α∞scene,␈α
and␈α∞a␈α
set␈α
of␈α∞features␈α
which␈α∞may␈α
or␈α∞may␈α
not␈α∞be␈α
present.␈α∞ Thus␈α
a
␈↓ ↓>␈↓model␈αis␈αan␈αarchtypical␈αscene␈αplus␈αa␈αname.␈α Each␈αtime␈αthe␈αprogram␈αis␈αconfronted␈αby␈αa␈αnew␈αscene,␈αthe
␈↓ ↓>␈↓program␈αmust␈αscan␈α
its␈αmodels␈αuntil␈α
it␈αfinds␈αone␈α
which␈αmatches␈αit.␈α
A␈αmodel␈αis␈α
said␈αto␈αmatch␈α
a␈αscene␈αif␈α
all
␈↓ ↓>␈↓the␈αMUST␈αfeatures␈αassociated␈αwith␈αthat␈αmodel␈αare␈αpresent␈αin␈αthe␈αscene,␈αand␈αall␈αthe␈αMUSTNOT␈αfeatures
␈↓ ↓>␈↓are␈αabsent␈αfrom␈αthe␈αscene.␈αCF␈αinforms␈αthe␈αuser␈αof␈αthis␈αguess,␈αand␈αaccepts␈αthe␈αproper␈αconcept␈αname.␈αIf
␈↓ ↓>␈↓it␈α
guessed␈α
incorrectly,␈α
it␈αmodifies␈α
its␈α
models.␈α
The␈αwrong␈α
guess␈α
model␈α
may␈αhave␈α
features␈α
added␈α
to␈αits
␈↓ ↓>␈↓MUST␈α∞or␈α∞MUSTNOT␈α∞sets;␈α∞the␈α∞correct␈α∞concept␈α∞name␈α∞model␈α∞may␈α∞have␈α∞to␈α∞be␈α∞modified␈α∞or␈α∞(if␈α∞it's␈α∞a␈α
new
␈↓ ↓>␈↓concept) created and inserted into the list of models. For more details, see [2].

␈↓"∧␈↓ ↓>␈↓␈↓ α≡␈↓&3.8.  A dynamic example␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡An␈α
example␈αof␈α
the␈αPUP6␈α
community␈α
of␈αBEINGs␈α
interacting␈αwill␈α
now␈α
be␈αpresented.␈α
 When␈αa␈α
BEING
␈↓ ↓>␈↓is␈αsaid␈αto␈αdo␈αor␈αrecognize␈αor␈αknow␈αsomething,␈αas␈αin␈αthe␈αfollowing␈αparagraphs,␈αwhat␈αis␈αactually␈αmeant␈αis
␈↓ ↓>␈↓that␈αone␈αor␈αmore␈αof␈αits␈α
parts␈αspecificly␈αencode␈αthat␈αknowledge.␈α All␈α
the␈αparts␈αof␈αthe␈αhundred␈αBEINGs␈α
in
␈↓ ↓>␈↓PUP6␈α
were␈αcoded␈α
by␈αhand,␈α
not␈αby␈α
each␈α
other.␈α They␈α
then␈αencoded␈α
other␈αBEINGs,␈α
interacting␈α
only␈αvia
␈↓ ↓>␈↓the dialogue.
␈↓ ↓>␈↓␈↓ α≡Let's␈α
jump␈α
one␈αthird␈α
of␈α
the␈αway␈α
into␈α
the␈α
dialogue␈αwhich␈α
writes␈α
CF.␈αThe␈α
system␈α
learns␈α
it␈αmust
␈↓ ↓>␈↓compare␈α⊂the␈α⊂input␈α⊃scene␈α⊂against␈α⊂its␈α⊂internally␈α⊃stored␈α⊂models␈α⊂of␈α⊂concepts,␈α⊃until␈α⊂it␈α⊂finds␈α⊃one␈α⊂which
␈↓ ↓>␈↓doesn't␈αfail␈αthe␈αcomparison.␈α
 It␈αasks␈αthe␈αuser␈αwhat␈α
it␈αmeans␈αfor␈αscene␈αS␈α
to␈αfail␈αthe␈αcomparison␈αto␈α
model
␈↓ ↓>␈↓M.␈α
The␈αuser␈α
replies,␈α
whenever␈αM␈α
is␈α
incompatible␈αwith␈α
the␈α
observed␈αfeatures␈α
of␈α
S.␈α The␈α
IDEN␈α
part␈αof␈α
the
␈↓ ↓>␈↓CONTRADICTS BEING recognizes this sentence pattern, and transforms it to
␈↓"∧␈↓ ↓>␈↓␈↓ α≡(FORSOME  F  IN M-FEATURES (specialized:contradicts F S-FEATURES)).

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α
BEING␈αwhich␈α
inserts␈αthis␈α
into␈α
the␈αsynthesized␈α
code␈αrequires␈α
that␈α
the␈αuser␈α
pick␈αsome␈α
proper
␈↓ ↓>␈↓name␈α∞for␈α∞the␈α∞function␈α
specialized:contradicts;␈α∞this␈α∞will␈α∞be␈α
a␈α∞streamlined␈α∞contradiction␈α∞test␈α∞written␈α
by
␈↓ ↓>␈↓the␈α
CONTRADICTS␈α
BEING.␈α∞ Say␈α
the␈α
user␈α
reponds␈α∞by␈α
calling␈α
it␈α
IMPOSS.␈α∞This␈α
naming␈α
and␈α∞specializing␈α
is
␈↓ ↓>␈↓central␈α
to␈αBEING␈α
creation:␈α
a␈αBEING␈α
recognizes␈αan␈α
instance␈α
of␈αitself,␈α
and␈αdecides␈α
either␈α
to␈αinsert␈α
a␈αcall␈α
to
␈↓ ↓>␈↓itself␈αor␈α
else␈αto␈α
insert␈αa␈αcall␈α
to␈αa␈α
specialized␈αversion␈α
of␈αitself.␈α If␈α
any␈αnontrivial␈α
decisions␈αmust␈αbe␈α
made,
␈↓ ↓>␈↓and␈α
can␈αbe␈α
settled␈α
at␈αsynthesis␈α
time,␈αthen␈α
the␈α
latter␈αalternative␈α
is␈α
chosen.␈α CONTRADICTS␈α
is␈αtoo␈α
general
␈↓ ↓>␈↓a␈α
BEING␈α
to␈α
be␈α
called␈α
in␈α∞an␈α
inner␈α
loop,␈α
so␈α
its␈α
content␈α
will␈α∞be␈α
hammered␈α
out␈α
at␈α
synthesis␈α
time.␈α∞On␈α
the
␈↓ ↓>␈↓other hand, FORSOME is so primitive that no specialized version of it is written normally.

␈↓"␈↓ ↓>␈↓␈↓ α≡Here is the way this piece of the dialogue actually appears.  The user's reponses are italicized.

␈↓"∧␈↓ ↓>␈↓PUP: Please type in a logical expression which is true iff we terminate the loop
␈↓"∧␈↓ ↓>␈↓USER: ␈↓β(Any feature in model-features is incompatible with scene-features)␈↓
␈↓"∧␈↓ ↓>␈↓PUP: PUP wants USER to type in name for specialized version of CONTRADICTS
␈↓"∧␈↓ ↓>␈↓USER: ␈↓βIMPOSS␈↓

␈↓"␈↓ ↓>␈↓␈↓ α≡Later␈α∂in␈α⊂the␈α∂dialogue,␈α⊂PUP6␈α∂decides␈α⊂it␈α∂must␈α⊂expand␈α∂the␈α⊂function␈α∂IMPOSS.␈α⊂The␈α∂CONTRADICTS
␈↓ ↓>␈↓BEING␈αis␈αagain␈αcalled␈α
on;␈αthis␈αtime␈αit␈αis␈α
asked␈αhow␈αto␈αwrite␈αa␈α
specialized␈αversion␈αof␈αa␈αcontradiction␈α
test.
␈↓ ↓>␈↓It␈α
replies␈α
that␈α
SOME-OF␈α
the␈α
following␈α
types␈α
of␈α
contradiction␈α
may␈α
occur:␈αPROBABILITY=0,␈α
PROBABILITY=1,
␈↓ ↓>␈↓and␈α∞PROBABILITYε(0,1).␈α∂ This␈α∞is␈α∞the␈α∂germ␈α∞of␈α∂the␈α∞idea␈α∞for␈α∂the␈α∞MUSTNOT/MUST/MAY␈α∂categorization␈α∞of
␈↓ ↓>␈↓features.␈αThe␈α
SOME-OF␈αBEING␈αtakes␈α
control,␈αand␈αasks␈α
if␈αthe␈αdecision␈α
can␈αbe␈αdeferred.␈α
 The␈αDEFERRAL
␈↓ ↓>␈↓BEING␈α
looks␈α∞about,␈α
first␈α
asking␈α∞if␈α
there␈α
is␈α∞any␈α
non-null␈α
piece␈α∞of␈α
code␈α
that␈α∞all␈α
three␈α
have␈α∞in␈α
common.
␈↓ ↓>␈↓This␈α∂fails,␈α∂and␈α∞eventually␈α∂the␈α∂DEFERRAL␈α∞BEING␈α∂reports␈α∂failure.␈α∞ SOME-OF␈α∂sees␈α∂it␈α∞has␈α∂no␈α∂basis␈α∞upon
␈↓ ↓>␈↓which␈α∞to␈α
form␈α∞a␈α
guess,␈α∞and␈α
wants␈α∞somebody␈α
to␈α∞ask␈α
the␈α∞user.␈α
 The␈α∞ASK-USER␈α
BEING␈α∞takes␈α∞over,␈α
and
␈↓ ↓>␈↓trivially␈αfinds␈αout␈αwhat␈αexactly␈αit␈αis␈αthat␈αPUP6␈αwants␈αto␈αlearn.␈α The␈αnames␈αof␈αthe␈αthree␈αchoices␈αare␈αso
␈↓ ↓>␈↓cryptic␈αthat␈αtheir␈αWHAT␈αand␈αHOW␈αparts␈αare␈αprinted␈αout␈αto␈αthe␈αuser,␈αas␈αwell␈αas␈αtheir␈αnames.␈α The␈αuser
␈↓ ↓>␈↓types␈αback␈α
his␈αchoices,␈α
in␈αour␈α
case␈αall␈α
three.␈α SOME-OF␈α
composes␈αthree␈α
new␈αfunction␈α
calls,␈αseparated
␈↓ ↓>␈↓by a conditional:

␈↓"∧␈↓ ↓>␈↓α(COND  ((IS-OF-TYPE  F  PROBABILITY=0-PART-OF-M-FEATURES) (PROBABILITY=0-CONTRADICTION  F  S-FEATURES))
␈↓"∧␈↓ ↓>␈↓α         ((IS-OF-TYPE  F  PROBABILITY=1-PART-OF-M-FEATURES) (PROBABILITY=1-CONTRADICTION  F  S-FEATURES))
␈↓"∧␈↓ ↓>␈↓α         ((IS-OF-TYPE  F  PROBABILITYε(0,1)-PART-OF-M-FEATURES) (PROBABILITYε(0,1)-CONTRADICTION  F  S-FEATURES)))

␈↓"␈↓ ↓>␈↓␈↓ α≡TRICHOTOMY␈α
recognizes␈α
this␈αas␈α
a␈α
split␈α
on␈αa␈α
function's␈α
values␈α
being␈α=0,␈α
=1,␈α
or␈α
between␈αzero␈α
and
␈↓ ↓>␈↓one.␈α⊂ It␈α⊂asks␈α⊂whether␈α⊂this␈α⊂particular␈α⊂function␈α∂can␈α⊂only␈α⊂range␈α⊂over␈α⊂the␈α⊂interval␈α⊂[0,1].␈α∂ PROBABILITY
␈↓ ↓>␈↓answers␈α∂affirmatively,␈α∞so␈α∂SOME-OF␈α∂replaces␈α∞the␈α∂final␈α∂IS-OF-TYPE␈α∞test␈α∂by␈α∂the␈α∞constant␈α∂T.␈α∂ Later␈α∞on,
␈↓ ↓>␈↓PUP6␈α
must␈α
worry␈α
about␈αthe␈α
other␈α
two␈α
tests,␈α
and␈αabout␈α
the␈α
three␈α
contradiction␈α
predicates.␈α These␈α
latter
␈↓ ↓>␈↓entities␈αknow␈α(their␈αENCODABLE␈αparts␈αtell␈α
them)␈αthat␈αthey␈αare␈αimmediately␈αencodable.␈α
A␈αprobability=0
␈↓ ↓>␈↓contradiction␈αmeans␈αthat␈αarg1␈αmust␈αnot␈αoccur␈αin␈αthe␈α
world␈αarg2␈αyet␈αit␈αdoes.␈α So␈αthe␈αMETA-CODE␈αof␈α
the
␈↓ ↓>␈↓PROBABILITY=0-CONTRADICTION␈α∩BEING␈α∪is␈α∩defined␈α∩as␈α∪(MEMBER␈α∩arg1␈α∩arg2).␈α∪ This␈α∩corresponds␈α∪to␈α∩a
␈↓ ↓>␈↓MUSTNOT␈α
feature␈α
F␈α
which␈α
is␈α
present␈α
in␈α
the␈α
world␈α
(in␈α
the␈α
set␈α
S-FEATURES,␈α
features␈α
of␈α
the␈α∞scene).␈α
A
␈↓ ↓>␈↓probability=1␈αcontradiction␈α
occurs␈αwhen␈α
a␈αfeature␈α
arg1␈αmust␈α
occur␈αin␈α
the␈αworld␈α
arg2,␈αyet␈α
it␈αdoesn't.␈α
So
␈↓ ↓>␈↓its␈α
definition␈α
is␈α
simply␈α
(NOT␈α
(MEMBER␈α
arg1␈α
arg2)).␈α It␈α
is␈α
impossible␈α
for␈α
a␈α
feature␈α
with␈α
probability␈αin␈α
(0,1)
␈↓ ↓>␈↓to␈α
be␈α
in␈α
contradiction␈α
with␈αany␈α
world␈α
(lacking␈α
negated␈α
features),␈αso␈α
this␈α
third␈α
predicate␈α
is␈α
defined␈αas
␈↓ ↓>␈↓the␈α∞constant␈α
NIL.␈α∞ That␈α
is,␈α∞if␈α
F␈α∞is␈α
a␈α∞MAY␈α∞feature␈α
of␈α∞the␈α
model␈α∞M,␈α
then␈α∞there␈α
can␈α∞be␈α∞no␈α
contradiction
␈↓ ↓>␈↓between F and ␈↓βany␈↓ features of the scene S.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈αIS-OF-TYPE␈αBEING␈α
recognizes␈αthat␈αit␈α
must␈αwork␈αhard␈α
to␈αreplace␈αeach␈α
of␈αthe␈αtwo␈αcase␈α
tests,
␈↓ ↓>␈↓unless␈α∞M-FEATURES␈α∞is␈α∞organized␈α∞permanently␈α∞into␈α∞three␈α∞parts␈α∞(thus␈α∞permitting␈α∞the␈α∞complex␈α
function
␈↓ ↓>␈↓"IS-OF-TYPE"␈α∃to␈α∃be␈α∃replaced␈α∃by␈α∃the␈α∃simple␈α∃one␈α∃"MEMBER"␈α∃in␈α∃the␈α∃above␈α∃piece␈α∃of␈α∃code).␈α∃The
␈↓ ↓>␈↓STRUCTURE-INDUCING␈α∂BEING␈α∂will␈α∞take␈α∂over,␈α∂to␈α∂probe␈α∞the␈α∂permissability␈α∂and␈α∞the␈α∂difficulty␈α∂of␈α∂such␈α∞a
␈↓ ↓>␈↓constraint.␈α
 It␈αfinds␈α
nothing␈α
about␈αthis␈α
tripartite␈αstructuring␈α
which␈α
could␈αdamage␈α
any␈αearlier␈α
synthesized
␈↓ ↓>␈↓code,␈α∞and␈α
asks␈α∞the␈α
user's␈α∞blessing.␈α
 Notes␈α∞are␈α
added␈α∞to␈α
the␈α∞list␈α
of␈α∞coding␈α
warnings,␈α∞stating␈α∞that␈α
any
␈↓ ↓>␈↓reference␈αto␈αthe␈αentire␈αlist␈αof␈αM-FEATURES␈αmust␈αbe␈αreplaced␈αby␈αeither␈αAPPEND␈αof␈αthe␈αthree␈αnew␈αlists,
␈↓ ↓>␈↓or␈α∞else␈α∞by␈α∞three␈α∞separate␈α∞statements.␈α∞GET-NAME␈α∞is␈α∞indirectly␈α∞called,␈α∞and␈α∞he␈α∞has␈α∞the␈α∞user␈α∞name␈α∞the
␈↓ ↓>␈↓three␈α
new␈α
sets␈α
of␈α
features;␈α∞say␈α
he␈α
responds␈α
by␈α
calling␈α∞them␈α
MUSTNOT,␈α
MUST,␈α
and␈α
MAY.␈α∞The␈α
system
␈↓ ↓>␈↓would␈α
at␈α
this␈α
point␈α
say␈α
to␈αdraw␈α
an␈α
arrow␈α
on␈α
its␈α
graph␈αof␈α
newly␈α
created␈α
BEINGs,␈α
going␈α
from␈αthe␈α
function
␈↓ ↓>␈↓call (IMPOSS F S-FEATURES) to the new block of code:

␈↓"∧␈↓ ↓>␈↓π  (COND  ((MEMBER  F  MUSTNOT-PART-OF-M)  (MEMBER  F  S-FEATURES))
␈↓"∧␈↓ ↓>␈↓π         ((MEMBER  F  MUST-PART-OF-M)  (NOT (MEMBER  F  S-FEATURES)))
␈↓"∧␈↓ ↓>␈↓π         ( T  (COMMENT THIS "T" REPLACES "MEMBER F MAY-PART-OF-M")  NIL))

␈↓"␈↓ ↓>␈↓␈↓ α≡This␈αis␈αnow␈αthe␈αMETA:CODE␈αpart␈αof␈αthe␈αnew␈αBEING␈αcalled␈αIMPOSS.␈α Most␈αof␈αthe␈αother␈αparts␈αare
␈↓ ↓>␈↓taken␈α
from␈αits␈α
generalization,␈αnamely␈α
CONTRADICTS.␈αDuring␈α
the␈αcourse␈α
of␈αwriting␈α
this␈α
piece,␈αhowever,
␈↓ ↓>␈↓some␈α∩of␈α∪these␈α∩parts␈α∩should␈α∪be␈α∩slightly␈α∩changed.␈α∪For␈α∩example,␈α∩its␈α∪reason␈α∩for␈α∩existing␈α∪should␈α∩be
␈↓ ↓>␈↓strengthened when the simple MEMBER function calls replaced the slow IS-OF-TYPE BEING calls.

␈↓"␈↓ ↓>␈↓␈↓ α≡Most␈αof␈αthis␈αprocessing␈αis␈αinter-BEING␈αactivity;␈αthe␈αuser␈αis␈αnot␈αneeded␈αfor␈α--␈αor␈αeven␈αinformed
␈↓ ↓>␈↓of␈α--␈α
most␈αof␈αit.␈α
 He␈αhas␈αthe␈α
feeling␈αof␈αmerely␈α
directing,␈αconstraining,␈αand␈α
watching␈αthe␈αactivities␈α
of␈αa
␈↓ ↓>␈↓busy␈αprogrammer.␈α Unfortunately,␈α"the␈αuser"␈αis␈αnot␈αgeneric;␈αthere␈αwas␈αonly␈αone␈αsuccessful␈αuser.␈αPUP6
␈↓ ↓>␈↓insists␈α⊂on␈α∂doing␈α⊂structured␈α⊂programming,␈α∂so␈α⊂its␈α∂traces␈α⊂are␈α⊂superficially␈α∂similar␈α⊂to␈α⊂macro␈α∂expansion.
␈↓ ↓>␈↓Despite this concentration on planning, no BEINGs system should halt so long as any details remain.
␈↓"∧
␈↓"∧␈↓ ↓>␈↓␈↓&3.10.  Excerpt from the synthesized program itself running␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α∞PUP6␈α∞system␈α∞interacts␈α∞with␈α∞the␈α∞user,␈α∂resulting␈α∞in␈α∞the␈α∞creation␈α∞of␈α∞CF,␈α∞the␈α∂desired␈α∞target
␈↓ ↓>␈↓program.␈α
 Like␈αPUP6,␈α
CF␈αis␈α
nothing␈αbut␈α
a␈αpool␈α
of␈αBEINGs.␈α
So,␈αas␈α
it␈αruns,␈α
the␈αuser␈α
can␈αinterrupt␈α
it␈αand
␈↓ ↓>␈↓ask␈α
it␈α
questions␈α
about␈α
what␈α
it's␈α
doing.␈α
The␈αanswers␈α
are␈α
typically␈α
just␈α
some␈α
parts␈α
of␈α
the␈αBEING␈α
currently
␈↓ ↓>␈↓in␈αcontrol.␈α An␈αexcerpt␈αof␈αCF␈αrunning␈α
without␈αinterruption␈αis␈αgiven␈αbelow,␈αfollowed␈αby␈αthe␈α
same␈αpiece
␈↓ ↓>␈↓with␈αinterruptions.␈αThe␈αuser's␈αresponses␈αare␈αin␈αitalics.␈α ␈↓βα:␈↓␈αsignifies␈αhe␈αhas␈αinterrupted,␈αand␈α␈↓ββ.␈↓␈αsignifies
␈↓ ↓>␈↓he␈α
has␈α
told␈αPUP6␈α
␈↓βOK,␈α
go␈α
back␈αto␈α
work␈α
now.␈↓␈α
Some␈αliberty␈α
has␈α
been␈α
taken␈αwith␈α
the␈α
English;␈α
e.g.,␈αthe␈α
user
␈↓ ↓>␈↓really types ␈↓βWHAT?␈↓, not ␈↓βWhat are you doing?␈↓

␈↓"∧␈↓ ↓>␈↓READY TO ACCEPT BRAND NEW SCENE:   ␈↓β(??? (A B) (BLOCK A) (GREEN B))␈↓
␈↓"∧␈↓ ↓>␈↓NOT AN ARCH. NOT A TOWER. MIGHT BE A ROW.  MY GUESS IS ROW.
␈↓"∧␈↓ ↓>␈↓WHAT IS IT REALLY?                 ␈↓βNOTHING␈↓
␈↓"∧␈↓ ↓>␈↓TRANSFER FROM MAY TO MUST SETS OF ROW: (TOUCH A B)
␈↓"∧␈↓ ↓>␈↓READY TO ACCEPT BRAND NEW SCENE:
␈↓ ↓>␈↓Here is the same excerpt, but with the user interrupting occasionally:
␈↓"∧␈↓ ↓>␈↓␈↓βα:  What are you doing?␈↓
␈↓"∧␈↓ ↓>␈↓PUP:  Divide a domain into subdomains, using specialized version of PARTITION-DOMAIN
␈↓"∧␈↓ ↓>␈↓        ␈↓βHow?␈↓
␈↓"∧␈↓ ↓>␈↓PUP:  By building up the partition gradually, by adding one <scene, name> pair
␈↓"∧␈↓ ↓>␈↓        ␈↓βOK. Go back to work␈↓

␈↓"∧␈↓ ↓>␈↓READY TO ACCEPT BRAND NEW SCENE:   ␈↓β(??? (A B) (BLOCK A) (GREEN B))␈↓

␈↓"∧␈↓ ↓>␈↓␈↓βα:  What are you doing?␈↓
␈↓"∧␈↓ ↓>␈↓PUP:  Break a piece off (??? (A B) (BLOCK A) (GREEN B)) to examine
␈↓"∧␈↓ ↓>␈↓        ␈↓βWhat is the meta-code of the current BEING?␈↓
␈↓"∧␈↓ ↓>␈↓PUP:  The meta-code of SOME-PART-OF (version 14) is (CAR arg1) ␈↓ββ.␈↓

␈↓"∧␈↓ ↓>␈↓NOT AN ARCH.
␈↓"∧␈↓ ↓>␈↓␈↓βα:  Why?␈↓
␈↓"∧␈↓ ↓>␈↓PUP: The ARCH MUST relation (SUPPORTS A B) is contradicted in the SCENE ␈↓ββ.␈↓

␈↓"∧␈↓ ↓>␈↓NOT A TOWER. MIGHT BE A ROW.  MY GUESS IS ROW.
␈↓"∧␈↓ ↓>␈↓WHAT IS IT REALLY?                 ␈↓βα:  Why are you asking?␈↓
␈↓"∧␈↓ ↓>␈↓PUP: PUP cannot resolve it, and must at this time, so PUP asks USER
␈↓"∧␈↓ ↓>␈↓        ␈↓βOK. What you wanted is:  NOTHING

␈↓"∧␈↓ ↓>␈↓βα:  What are you doing?␈↓
␈↓"∧␈↓ ↓>␈↓PUP: Go through space of concept names, and make user aware of changes
␈↓"∧␈↓ ↓>␈↓        ␈↓βWhat BEINGs might this affect?␈↓
␈↓"∧␈↓ ↓>␈↓PUP: MESSAGE is possibly called; some version of TEST is possibly called  ␈↓ββ.␈↓

␈↓"∧␈↓ ↓>␈↓TRANSFER FROM MAY TO MUST SETS OF ROW: (TOUCH A B)
␈↓"∧␈↓ ↓>␈↓READY TO ACCEPT BRAND NEW SCENE:


␈↓"∧␈↓ ↓>␈↓␈↓&3.10.  BEINGs applied to volleyball and mathematics␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡Since␈α⊗the␈α⊗only␈α⊗existing␈α∃BEINGs␈α⊗system␈α⊗does␈α⊗automatic␈α∃programming,␈α⊗it␈α⊗is␈α⊗excusable␈α∃to
␈↓ ↓>␈↓concentrate␈α
on␈αthat␈α
task.␈α
 Let␈αus␈α
briefly␈αdigress,␈α
however,␈α
to␈αindicate␈α
how␈α
a␈αcommunity␈α
of␈αBEINGs␈α
could
␈↓ ↓>␈↓do other activities.

␈↓"␈↓ ↓>␈↓␈↓ α≡Consider␈α⊃first␈α∩the␈α⊃simulation␈α∩of␈α⊃a␈α∩volleyball␈α⊃game.␈α∩A␈α⊃BEINGs-based␈α∩system␈α⊃might␈α∩create␈α⊃a
␈↓ ↓>␈↓specialized␈α∞BEING␈α∞for␈α∞each␈α∞player,␈α∞perhaps␈α
with␈α∞a␈α∞complexity␈α∞vector␈α∞indicating␈α∞his␈α∞abilities,␈α
reflexes,
␈↓ ↓>␈↓etc.␈α The␈αBEING␈αin␈αcontrol␈αwould␈αbe␈αthe␈αplayer␈αhitting␈αthe␈αball.␈αA␈αspecialized␈αChoose-from␈αBEING␈αwould
␈↓ ↓>␈↓decide␈α
who␈α
goes␈αnext,␈α
occasionally␈α
interpreting␈α
a␈αtie␈α
between␈α
BEINGs␈α
vying␈αfor␈α
control␈α
as␈α
a␈αcollision␈α
on
␈↓ ↓>␈↓the court.

␈↓"␈↓ ↓>␈↓␈↓ α≡A␈α∞less␈α∞bizarre␈α∞enterprise␈α∞for␈α∞BEINGs␈α∞is␈α∞the␈α∞understanding␈α∞of␈α∞mathematics.␈α∞ Such␈α∞a␈α∞project␈α∞is
␈↓ ↓>␈↓now␈α∪in␈α∀progress␈α∪at␈α∪SAIL,␈α∀encompassing␈α∪learning,␈α∀discovery,␈α∪and␈α∪intuition,␈α∀in␈α∪several␈α∀domains␈α∪of
␈↓ ↓>␈↓mathematics.␈α The␈αdriving␈αforce␈αin␈αsuch␈αa␈αsystem␈αis␈αaesthetic:␈αthe␈αdesire␈αto␈αcomplete␈αeach␈αBEING.␈α
Since
␈↓ ↓>␈↓the␈αtask␈α
is␈αno␈αlonger␈α
to␈αwrite␈αprograms,␈α
a␈αdifferent␈α
set␈αof␈αBEING␈α
parts␈αis␈αcalled␈α
for.␈α For␈αefficiency,␈α
the
␈↓ ↓>␈↓guidance␈α∂strategies␈α∂might␈α∂be␈α∞implemented␈α∂as␈α∂rules.␈α∂ There␈α∞would␈α∂be␈α∂a␈α∂BEING␈α∞for␈α∂each␈α∂entity,␈α∂be␈α∞it
␈↓ ↓>␈↓object, operator, analogy, etc.  Its parts might be as follows:
␈↓ ↓>␈↓␈↓↓DEFINITIONS␈↓   Several equivalent definitions
␈↓"∧␈↓ ↓>␈↓␈↓↓NAME␈↓  Significant English variations
␈↓"∧␈↓ ↓>␈↓␈↓↓IDEN␈↓  Tests to see if this operator is the one being referred to
␈↓"∧␈↓ ↓>␈↓␈↓↓NOT-IDEN␈↓  Tests to see if this operator is irrelevant
␈↓"∧␈↓ ↓>␈↓␈↓↓QUICK-IDEN/NOT-IDEN␈↓  Cheap tests to see if operator is/isn't relevant
␈↓"∧␈↓ ↓>␈↓␈↓↓EXAMPLES␈↓  Includes trivial, typical, and advanced cases; non-examples
␈↓"∧␈↓ ↓>␈↓␈↓↓BOUNDARY␈↓  Examples which characterize the limits of this concept
␈↓"∧␈↓ ↓>␈↓␈↓↓FIX-BOUNDARY␈↓  How can you change a concept so it crosses this border?
␈↓"∧␈↓ ↓>␈↓␈↓↓IMAGE␈↓  Analogic interpretations: ties to simpler concepts, to real-world
␈↓"∧␈↓ ↓>␈↓␈↓↓WHY␈↓  Why is this worth naming as a separate BEING?
␈↓"∧␈↓ ↓>␈↓␈↓↓USE␈↓  Where is this used frequently, to advantage?
␈↓"∧␈↓ ↓>␈↓␈↓↓GENERALIZATIONS␈↓  What is this a special case of?   The new features
␈↓"∧␈↓ ↓>␈↓␈↓↓SPECIALIZATIONS␈↓  What are special cases of this?  What is simplified?
␈↓"∧␈↓ ↓>␈↓␈↓↓REPRESENTATION␈↓  How should this be represented internally?
␈↓"∧␈↓ ↓>␈↓␈↓↓TIES␈↓  What other objects and operators are associated with this concept?
␈↓"∧␈↓ ↓>␈↓␈↓↓RESTRICTIONS␈↓        What can't it do, or one do to it?   Temporary?
␈↓"∧␈↓ ↓>␈↓␈↓↓VALUE␈↓  Aesthetic worth, efficiency ratings, complexity, certainty, ubiquity
␈↓"∧␈↓ ↓>␈↓␈↓↓EFFECTS␈↓  The range for an operator, the results of using this concept
␈↓"∧␈↓ ↓>␈↓␈↓↓VIEWS␈↓  How to view as an operator, property, set, object, relationship
␈↓"∧␈↓ ↓>␈↓␈↓↓HANDLES␈↓  How to compute (get a handle on) this concept

␈↓"∧
␈↓"∧␈↓ ↓>␈↓␈α?␈α?␈α?␈α?␈α?␈α?␈α(␈↓∧␈↓&4. Automatic Programming Task␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡After␈α
the␈α
target␈αconcept␈α
formation␈α
program␈αwas␈α
specified,␈α
it␈α
was␈αtrimmed␈α
and␈α
then␈αrewritten␈α
as
␈↓ ↓>␈↓a␈α∞structured␈α∞program␈α∞[11].␈α∂Next,␈α∞a␈α∞complete␈α∞dialogue␈α∞was␈α∂simulated␈α∞between␈α∞the␈α∞user␈α∞and␈α∂a␈α∞human
␈↓ ↓>␈↓programmer␈α⊗(referred␈α↔to␈α⊗as␈α↔the␈α⊗system-player)␈α⊗playing␈α↔the␈α⊗role␈α↔of␈α⊗an␈α↔"intelligent"␈α⊗automatic
␈↓ ↓>␈↓programming␈αsystem␈α(similar␈αto,␈α
e.g.,␈α[12]).␈α The␈αsystem-player␈α
kept␈αcareful␈αrecords␈αas␈αhe␈α
programmed,
␈↓ ↓>␈↓and␈αtried␈αto␈αcreate␈αa␈αbug-free␈αstructured␈αprogram.␈α The␈αdialogue␈αwas␈αthen␈αannotated:␈αafter␈αeach␈αuser
␈↓ ↓>␈↓response,␈α
comments␈α
were␈α
inserted␈α
which␈α
described␈α
the␈α
"states"␈α
the␈α
system-player␈α
had␈α
gone␈α
through
␈↓ ↓>␈↓before␈α∞printing␈α∞his␈α
next␈α∞response.␈α∞ This␈α
included␈α∞blind␈α∞paths␈α
which␈α∞were␈α∞tried,␈α
use␈α∞of␈α∞outside␈α
world
␈↓ ↓>␈↓knowledge,␈αand,␈αin␈αgeneral,␈αwas␈αmeant␈αto␈αbe␈αthe␈α"intelligence"␈αnecessary␈αto␈αdo␈αthe␈αtask.␈α The␈αfear␈αwas
␈↓ ↓>␈↓that␈α∩a␈α∩system␈α⊃could␈α∩be␈α∩built␈α∩which␈α⊃synthesized␈α∩the␈α∩concept␈α∩formation␈α⊃program,␈α∩and␈α∩yet␈α∩was␈α⊃so
␈↓ ↓>␈↓unintelligent that nothing was learned from it. (see section 4.1 on PW1, for example, in [13]).

␈↓"␈↓ ↓>␈↓␈↓ α≡Hopefully,␈α∩any␈α∩system␈α∩which␈α∪(i)␈α∩got␈α∩the␈α∩target␈α∪program␈α∩correctly,␈α∩(ii)␈α∩followed␈α∪this␈α∩initial
␈↓ ↓>␈↓dialogue,␈α∩and,␈α∩most␈α⊃importantly,␈α∩(iii)␈α∩went␈α∩through␈α⊃the␈α∩same␈α∩line␈α⊃of␈α∩reasoning␈α∩that␈α∩the␈α⊃comments
␈↓ ↓>␈↓indicated␈αthe␈αsystem-player␈αfollowed,␈αwould␈αbe␈α
far␈αalong␈αthe␈αroad␈αtoward␈αintelligence.␈α A␈α
corollary␈αof
␈↓ ↓>␈↓this␈αincremental␈αannotated␈αprotocol␈αapproach␈αis␈αthat␈αthe␈αabilities␈αof␈αthe␈αuser␈αmust␈αcoincide␈αwith␈αthose
␈↓ ↓>␈↓of␈α⊂the␈α⊃subject␈α⊂who␈α⊃participated␈α⊂in␈α⊃the␈α⊂protocol.␈α⊂The␈α⊃system␈α⊂would␈α⊃be␈α⊂far␈α⊃along␈α⊂the␈α⊃road␈α⊂toward
␈↓ ↓>␈↓automatic␈αprogramming␈αif␈α
it␈αalso␈α(iv)␈αwas␈α
able␈αto␈αwrite␈αCF␈α
from␈αseveral␈αdialogues,␈αfrom␈α
several␈αusers,
␈↓ ↓>␈↓with␈α∞little␈α∞preparation.␈α∞PUP6␈α∞was␈α∞not␈α∞designed␈α∞to␈α∞do␈α∞this,␈α∞and␈α∞in␈α∞the␈α∞end␈α∞it␈α∞proved␈α∞to␈α∞be␈α∞a␈α∞serious
␈↓ ↓>␈↓deficit.  Henceforth, ␈↓βprotocol␈↓ will refer to this user-player / system-player simulated dialogue.

␈↓"␈↓ ↓>␈↓␈↓ α≡At␈αthis␈αpoint,␈αa␈αrough␈αinitial␈αset␈αof␈αBEINGs␈αsurfaced.␈α Each␈αone␈αhad␈αnot␈αmuch␈αmore␈αthan␈αa␈αname
␈↓ ↓>␈↓and␈αa␈αvague␈αdescription␈αof␈αwhat␈αit␈αmust␈αdo.␈α The␈αdialogue␈αwas␈αcycled␈αthrough␈αagain,␈αpainstakingly,␈αand
␈↓ ↓>␈↓the␈αcomments␈α
were␈αreplaced␈α
by␈αa␈α
description␈αof␈αwhich␈α
BEINGs␈αwould␈α
call␈αwhich␈α
other␈αBEINGs,␈αwhy,␈α
and
␈↓ ↓>␈↓the␈α⊂results␈α⊃of␈α⊂each␈α⊃such␈α⊂call.␈α⊃ The␈α⊂constraints␈α⊃on␈α⊂each␈α⊃BEING␈α⊂thus␈α⊃grew,␈α⊂sometimes␈α⊃changed,␈α⊂and
␈↓ ↓>␈↓occasionally␈αa␈αnew␈αBEING␈αor␈αBEING␈αpart␈αhad␈αto␈αbe␈αadded␈αto␈αthe␈αdesign.␈α This␈αprocess␈αproduced␈αa␈αlong
␈↓ ↓>␈↓hand␈αtrace␈αof␈αthe␈αsystem␈αexecution.␈α About␈αeighty␈αBEINGs␈αwere␈αneeded:␈αa␈αdozen␈αdomain-specific␈αones
␈↓ ↓>␈↓and the rest domain-independent programming knowledge.
␈↓ ↓>␈↓␈↓ α≡A␈α∞result␈α∞of␈α∞this␈α∞method␈α∞of␈α∞incremental␈α
specification␈α∞of␈α∞BEINGs␈α∞was␈α∞that␈α∞each␈α∞BEING␈α∞had␈α
only
␈↓ ↓>␈↓those␈α⊂parts␈α⊂which␈α⊂were␈α⊂going␈α⊂to␈α⊂be␈α⊃used␈α⊂sometime␈α⊂during␈α⊂the␈α⊂ensuing␈α⊂dialogue.␈α⊂This␈α⊃seemed␈α⊂too
␈↓ ↓>␈↓specific,␈αso␈αsome␈αeffort␈αwas␈αspent␈αfilling␈αout␈α
parts␈αthat␈αweren't␈αstrictly␈αnecessary␈αto␈αwrite␈αthe␈α
concept
␈↓ ↓>␈↓formation␈αprogram.␈α Perhaps␈αmore␈αcareful␈αattention␈αto␈αthis␈αactivity␈αwould␈αhave␈αmade␈αthe␈αsystem␈αmore
␈↓ ↓>␈↓tolerant of changes in the dialogue.

␈↓"␈↓ ↓>␈↓␈↓ α≡Good␈αmeasures␈αof␈αconcentration␈α
of␈αintelligence␈αare␈αnot␈αyet␈α
available.␈α The␈αonly␈αalternative␈αis␈α
to
␈↓ ↓>␈↓present␈α
ephemeral␈α
numerical␈α
efficiency␈α
data,␈α
which␈α
now␈α
follows.␈α
PUP6␈α
is␈α
200␈α
pages␈α
long␈αwhen␈α
PRETTY-
␈↓ ↓>␈↓PRINTED,␈αand␈αhas␈αsynthesized␈αthree␈αLISP␈αprograms,␈α7,␈α20,␈αand␈α30␈αpages␈αlong␈α(1,␈α4,␈αand␈α6␈αpages,␈αwhen
␈↓ ↓>␈↓coded␈αby␈α
hand).␈α PUP6␈α
takes␈α60␈αcpu␈α
minutes␈αto␈α
produce␈αCF␈α(compiled␈α
INTERLISP␈αcode,␈α
run␈αon␈αa␈α
PDP-10
␈↓ ↓>␈↓TENEX␈αsystem).␈α
During␈αthis␈α
time,␈α300K␈α
characters␈αget␈αtyped␈α
out␈αto␈α
the␈αuser,␈α
who␈αreponds␈α
with␈αabout
␈↓ ↓>␈↓4K␈α∞himself.␈α∂ The␈α∞mean␈α∂wait␈α∞time␈α∂(between␈α∞the␈α∞user's␈α∂input␈α∞and␈α∂the␈α∞next␈α∂machine␈α∞output)␈α∂is␈α∞several
␈↓ ↓>␈↓seconds. The longest delay between successive user inputs is 1 CPU minute.
␈↓"∧
␈↓"∧␈↓ ↓>␈↓␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α?␈α,␈↓∧␈↓&5. Conclusions␈↓'β

␈↓"␈↓ ↓>␈↓␈↓ α≡While␈α⊂the␈α⊂exact␈α⊃number␈α⊂of␈α⊂BEING␈α⊂parts␈α⊃is␈α⊂unimportant,␈α⊂its␈α⊂magnitude␈α⊃(a␈α⊂few␈α⊂tens)␈α⊃may␈α⊂be
␈↓ ↓>␈↓relevant␈α
to␈αthe␈α
feasability␈αof␈α
BEINGs␈αsystems.␈α
 If␈αit␈α
were␈α~1,␈α
any␈αuniform␈α
representation␈α(e.g.,␈α
predicate
␈↓ ↓>␈↓calculus)␈α
would␈α
be␈α
as␈α
easy␈α
to␈α
use;␈α
if␈α
it␈α
were␈α
~1000,␈α
the␈α
task␈α
of␈α
creating␈α
the␈α
original␈α
pool␈α
of␈α
BEINGs
␈↓ ↓>␈↓would␈α⊂be␈α⊃too␈α⊂formidable␈α⊃and␈α⊂ill-structured.␈α⊃ The␈α⊂number␈α⊂of␈α⊃BEING␈α⊂parts␈α⊃is␈α⊂therefore␈α⊃a␈α⊂parameter
␈↓ ↓>␈↓expressing␈α⊂the␈α⊂degreee␈α⊂of␈α⊂compromise␈α⊂between␈α∂structure␈α⊂and␈α⊂standardization␈α⊂in␈α⊂the␈α⊂community␈α∂of
␈↓ ↓>␈↓BEINGs.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α∂location␈α⊂of␈α∂relevant␈α⊂information␈α∂is␈α⊂effected␈α∂by␈α⊂giving␈α∂each␈α⊂BEING␈α∂the␈α⊂responsibility␈α∂for
␈↓ ↓>␈↓recognizing␈α⊂when␈α⊂it␈α⊂is␈α⊂talked␈α⊂about.␈α⊂ This␈α⊂distributed␈α⊂activity␈α⊂beats␈α⊂the␈α⊂exponential␈α⊂nature␈α⊃of␈α⊂this
␈↓ ↓>␈↓problem, iff the computer used has as many processors as there are BEINGs.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈αonly␈αstartling␈αresult␈αwas␈αthe␈α"inteligent"␈αstyle␈αof␈αthe␈αgenerated␈αcode.␈α As␈αshown␈αin␈αsection
␈↓ ↓>␈↓3.9, the synthesized programs can be interrupted and queried as they run.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α
set␈α
of␈α
questions␈α
the␈α
user␈α
was␈α
expected␈α
to␈α
want␈α
to␈α
ask␈α
is␈α
similar␈α
to␈α
the␈α
set␈α
of␈αquestions␈α
one
␈↓ ↓>␈↓BEING␈αcan␈αask␈αanother:␈αthe␈αBEING␈αparts.␈α When␈αa␈α"nice"␈αuser␈αinterrupts,␈αhis␈αquestion␈αis␈αanswered␈αby␈αa
␈↓ ↓>␈↓simple retrieval.  Real users were seldom nice; PUP6 often misunderstood what was asked.

␈↓"␈↓ ↓>␈↓␈↓ α≡To␈αmodify␈αPUP6␈αto␈αsynthesize␈αprograms␈αin␈α
a␈αdomain␈αother␈αthan␈αinductive␈αinference,␈αit␈αwould␈α
be
␈↓ ↓>␈↓necessary␈α⊗to␈α∃add␈α⊗a␈α∃few␈α⊗domain-independent␈α∃BEINGs␈α⊗and␈α∃several␈α⊗domain-specific␈α∃ones,␈α⊗and␈α∃to
␈↓ ↓>␈↓generalize␈αsome␈αparts␈αof␈αsome␈αexisting␈αBEINGs.␈α The␈αsecond␈αand␈αthird␈αtarget␈αprograms␈αwere␈α
attempted
␈↓ ↓>␈↓to␈αdetermine␈α
just␈αhow␈α
difficult␈αthis␈α
task␈αis.␈α In␈α
fact,␈αmost␈α
of␈αthe␈α
existing␈αBEINGs␈α
␈↓βwere␈↓␈αused␈αin␈α
generating
␈↓ ↓>␈↓those␈αnew␈αtarget␈αprograms.␈α Although␈αonly␈αa␈αfew␈αnew␈αBEINGs␈αwere␈αneeded,␈αthey␈αcould␈αnot␈αhave␈αbeen
␈↓ ↓>␈↓added␈α∪by␈α∪an␈α∪untrained␈α∪user.␈α∩Also,␈α∪the␈α∪dialogues␈α∪were␈α∪not␈α∩well-suited␈α∪to␈α∪their␈α∪tasks␈α∪(since␈α∩the
␈↓ ↓>␈↓communication subsystem was generated from a concept-formation protocol) and were quite brittle.

␈↓"␈↓ ↓>␈↓␈↓ α≡There␈α⊂was␈α⊂no␈α⊂sophistocated␈α⊂user␈α⊂model,␈α⊂and␈α⊂this␈α⊂caused␈α⊂the␈α⊂entire␈α⊂system␈α⊂to␈α⊂suffer.␈α⊂ The
␈↓ ↓>␈↓BEINGs␈α∪didn't␈α∩have␈α∪any␈α∪indication␈α∩of␈α∪how␈α∩verbose␈α∪they␈α∪were␈α∩in␈α∪toto.␈α∩ Swamping␈α∪the␈α∪user␈α∩with
␈↓ ↓>␈↓unneeded␈α
detail␈α
also␈α
increases␈α
his␈α
chances␈αof␈α
erring.␈α
 It␈α
became␈α
necessary␈α
to␈α
insert␈αa␈α
FORGETFUL-USER
␈↓ ↓>␈↓demon,␈α
to␈αprevent,␈α
e.g.,␈α
delayed␈αanaphora.␈α
 Related␈α
to␈αthis␈α
is␈αthe␈α
problem␈α
of␈αkeeping␈α
the␈α
human␈αuser
␈↓ ↓>␈↓oriented.␈α PUP6␈αused␈αthe␈αobvious␈αscheme␈α(cursors␈αpointing␈αinto␈αa␈αgraph␈αof␈αthe␈αnewly␈αcreated␈αBEINGs),
␈↓ ↓>␈↓which␈α
was␈α∞insufficient.␈α
The␈α
user␈α∞often␈α
wished␈α
to␈α∞refer␈α
to␈α
a␈α∞section␈α
not␈α
by␈α∞name␈α
or␈α
by␈α∞pointing,␈α
but
␈↓ ↓>␈↓rather by some brief, descriptive, meaningful (to him only!) phrase.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈αdesign␈αof␈α
BEINGs␈αis␈αtoward␈α
large␈αprograms;␈αlow-level,␈α
efficient␈αcode␈αcould␈α
be␈αturned␈αout␈α
as
␈↓ ↓>␈↓a␈α␈↓βsimulation␈↓␈αeffort,␈αmuch␈αas␈αplaying␈αvolleyball.␈αThe␈αanalogue␈αis␈αusing␈αa␈αhigh-level␈αlanguage␈αto␈αturn␈αout
␈↓ ↓>␈↓efficient machine code.

␈↓"␈↓ ↓>␈↓␈↓ α≡Some␈α∞of␈α∂the␈α∞BEING␈α∞parts␈α∂proved␈α∞unnecessary.␈α∂The␈α∞CO-REQUISITES␈α∞part␈α∂was␈α∞never␈α∂used:␈α∞the
␈↓ ↓>␈↓only␈αsimultaneous␈αactivity␈αneeded␈αwas␈αdemon␈α
activiation.␈α The␈αAFFECTS␈αpart␈αwas␈αof␈αoccasional␈α
interest
␈↓ ↓>␈↓to␈α∞the␈α
user,␈α∞but␈α
not␈α∞really␈α
used␈α∞by␈α
any␈α∞BEINGs.␈α
 The␈α∞EFFECTS␈α
part␈α∞originally␈α
had␈α∞a␈α∞twin,␈α
describing
␈↓ ↓>␈↓what␈αwould␈αhappen␈αif␈αthe␈αBEING␈αwere␈α␈↓βnot␈↓␈αexecuted␈αthen.␈αIn␈αeach␈αcase,␈αthis␈αturned␈αout␈αto␈αbe␈αmerely␈αa
␈↓ ↓>␈↓restatement of the frame problem.

␈↓"␈↓ ↓>␈↓␈↓ α≡The␈α
idea␈α
of␈αa␈α
universal␈α
set␈αof␈α
BEING␈α
parts␈α
(for␈αa␈α
given␈α
system)␈αfared␈α
marginally␈α
well.␈α Each␈α
part
␈↓ ↓>␈↓was␈α
used␈α∞in␈α
about␈α∞a␈α
third␈α∞of␈α
all␈α∞BEINGs,␈α
and␈α
each␈α∞BEING␈α
used␈α∞about␈α
a␈α∞third␈α
of␈α∞all␈α
possible␈α∞parts.␈α
 If
␈↓ ↓>␈↓these␈αfractions␈αhad␈αbeen␈αmuch␈αlower,␈αthe␈αadvantage␈αof␈αuniformity␈αwould␈αhave␈αvanished.␈α The␈αfuture␈αof
␈↓ ↓>␈↓BEINGs␈α(e.g.,␈α
in␈αthe␈αcurrent␈α
math-understanding␈αproject)␈αseems␈α
to␈αbe␈αas␈α
a␈αtool,␈αa␈α
single␈αaspect␈α
of␈αthe
␈↓ ↓>␈↓system.

␈↓"␈↓ ↓>␈↓␈↓&6.  References␈↓'β
␈↓"∃␈↓ ↓>␈↓[12] Balzer, Robert, AIRLINE reserv. study..., 197..
␈↓"∃␈↓ ↓>␈↓[11]␈α∞Gadwa,␈α∞Peter,␈α∞␈↓βSPOT,␈α∞a␈α∞mini␈α∞concept␈α∞formation␈α∞program␈↓,␈α∞Unpublished␈α∞Master's␈α∞Thesis,␈α∞Artificial
␈↓"ε␈↓ ↓>␈↓Intelligence Laboratory, Stanford University, Stanford, California, August, 1973.
␈↓"∃␈↓ ↓>␈↓[13]␈α⊂Green␈α⊂et␈α⊂al.,␈α⊂␈↓βProgress␈α⊃Report␈α⊂on␈α⊂Program-Understanding␈α⊂Systems␈↓,␈α⊂Memo␈α⊂AIM-240,␈α⊃CS␈α⊂Report
␈↓"ε␈↓ ↓>␈↓STAN-CS-74-444,Artificial Intelligence Laboratory, Stanford University, August, 1974.
␈↓"∃␈↓ ↓>␈↓[10]␈αHempel,␈αCarl␈αG.,␈α␈↓βFundamentals␈αof␈αConcept␈αFormation␈αin␈αEmpirical␈αScience␈↓,␈αUniversity␈αof␈αChicago,
␈↓"ε␈↓ ↓>␈↓Chicago, Illinois, 1952.
␈↓"∃␈↓ ↓>␈↓[1]␈αHewitt,␈αCarl,␈α
␈↓βA␈αUniversal␈αModular␈αACTOR␈α
Formalism␈αfor␈αArtificial␈αIntelligence␈↓,␈α
3rd␈αInternational
␈↓"ε␈↓ ↓>␈↓Joint Conference on Artificial Intelligence, 1973, pp. 235-245.
␈↓"∃␈↓ ↓>␈↓[8] Kay, Allen, ␈↓βCLASSes paper␈↓, ...
␈↓"∃␈↓ ↓>␈↓[9] Minsky, Marvin, ␈↓βFrames␈↓, in ␈↓βPsychology of Computer Vision␈↓, 1974.
␈↓"∃␈↓ ↓>␈↓[4]␈α⊂McCarthy,␈α⊂John,and␈α⊂Hayes,␈α⊂P.,␈α⊂␈↓βSome␈α⊂Philosophical␈α⊂Problems␈α⊂From␈α⊂the␈α⊂Standpoint␈α⊃of␈α⊂Artificial
␈↓"ε␈↓ ↓>␈↓βIntelligence␈↓, Machine Intelligence 4, pp. 463-502.
␈↓"∃␈↓ ↓>␈↓[5]␈αMinsky,␈αMarvin,␈α
and␈αPapert,␈αSeymour,␈α
␈↓βArtificial␈αIntelligence␈αProgress␈α
Report␈↓,␈αMIT␈αProject␈α
MAC,␈αAI
␈↓"ε␈↓ ↓>␈↓Memo 252, 1972.
␈↓"∃␈↓ ↓>␈↓[3] Newell, Allen, and Simon, Herbert, ␈↓βHuman Problem Solving␈↓, 1973.
␈↓"∃␈↓ ↓>␈↓[6] Teitelman, Warren, ␈↓βINTERLISP Reference Manual␈↓, XEROX PARC, 1974.
␈↓"∃␈↓ ↓>␈↓[2]␈α
Winston,␈α
Patrick,␈α
␈↓βLearning␈α
Structural␈α
Descriptions␈α
from␈α
Examples␈↓,␈α
Ph.D.␈α
thesis,␈α
Dept.␈α
of␈αElectrical
␈↓"ε␈↓ ↓>␈↓Engineering, TR-76, Project MAC, TR-231, MIT AI Lab, September, 1970.
␈↓"∃␈↓ ↓>␈↓The␈α
ideas␈α
and␈α
the␈α
system␈α
described␈αuse␈α
concepts␈α
from␈α
ACTORS,␈α
heterarchy,␈α
structured␈αprogramming,
␈↓"ε␈↓ ↓>␈↓assertional␈α∞data␈α∞bases,␈α∂flexible␈α∞data␈α∞types,␈α∞pattern-directed␈α∂invocation␈α∞of␈α∞procedural␈α∂knowledge,␈α∞the
␈↓"ε␈↓ ↓>␈↓paradigm␈α
of␈αdialogue,␈α
studies␈αon␈α
program␈αspecification,␈α
QLISP,␈αINTERLISP,␈α
LISP,␈αEnglish,␈α
...␈α
In␈αparticular,
␈↓"ε␈↓ ↓>␈↓the␈αauthor␈αdrew␈αheavily␈αfrom␈αcreative␈αdiscussions␈αwith␈αC.␈αGreen,␈αR.␈αWaldinger,␈αD.␈αBarstow,␈αB.␈αMcCune,
␈↓"ε␈↓ ↓>␈↓D. Shaw, E. Sacerdoti, and L. Steinberg.